In Semantic Web, using rules to add more expressive power has drawn considerable attention. Recently ORL (OWL Rules Language) has been presented where OWL is extended with Horn clause rules. In this paper we propose a...
详细信息
ISBN:
(纸本)3540238425
In Semantic Web, using rules to add more expressive power has drawn considerable attention. Recently ORL (OWL Rules Language) has been presented where OWL is extended with Horn clause rules. In this paper we propose an extension to OWL with more general rules involving not only atoms but also literals with classical negation and negation as failure. We present first the abstract syntax for our OWL extension and then its semantics via the Answer Set programming(ASP). Furthermore, we discuss the iterative procedures for reasoning between OWL axioms and ASP rules.
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input program before the actual reasoning sta...
详细信息
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input program before the actual reasoning starts. This prevents ASP to be effective on several classes of problems. In this paper we integrate answer set generation and constraint solving to reduce the memory requirements for a class of multi-sorted logic programs with cardinality constraints. We prove some theoretical results, introduce a provably sound and complete algorithm, and report experimental results showing that our approach can solve problem instances with significantly larger domains.
This book constitutes revised selected papers from the workshops collocated with the SEFM 2014 conference on Software Engineering and Formal Methods, held in Grenoble, France, in September 2014. The 26 papers included...
详细信息
ISBN:
(数字)9783319152011
ISBN:
(纸本)9783319152004
This book constitutes revised selected papers from the workshops collocated with the SEFM 2014 conference on Software Engineering and Formal Methods, held in Grenoble, France, in September 2014. The 26 papers included in this volume were carefully reviewed and selected from 49 submissions. They are from the following workshops: the 1st workshop on Human-Oriented Formal Methods - From Readability to Automation, HOFM 2014, the 3rdinternational Symposium on Modelling and knowledge Management Applications - Systems and Domains, MoKMaSD 2014, the 8th internationalworkshop on Foundations and Techniques for Open Source Software Certification, Open Cert 2014, the 1st workshop on Safety and Formal Methods, SaFoMe 2014 and the 4th workshop on Formal Methods in the Development of Software, WS-FMDS 2014.
The proceedings contain 6 papers. The topics discussed include: solving set constraints in B and event-B: foundations and applications;encoding sets as real numbers;programming in Java with restricted intensional sets...
The proceedings contain 6 papers. The topics discussed include: solving set constraints in B and event-B: foundations and applications;encoding sets as real numbers;programming in Java with restricted intensional sets;towards Coq formalisation of {log} set constraints resolution;on perfect matchings for some bipartite graphs;a set-based reasoner for the description logic DL4,x D;and polarized rewriting and tableaux in B set theory.
Creation of customized animated 3D content is an important issue in web-based VR/AR environments that involve users with various requirements for the content, e.g., in education, training, tourism, cultural heritage a...
详细信息
Creation of customized animated 3D content is an important issue in web-based VR/AR environments that involve users with various requirements for the content, e.g., in education, training, tourism, cultural heritage and e-commerce. 3D content customization is a complex task, as it typically covers various content features such as geometry, structure and appearance. Although a number of tools enable modeling of 3D animations, they do not support on-demand animation customization to users' requirements specified using semantic (application or domain-specific) concepts. Available solutions permit creation of 3D content in its final form, require technical knowledge and skills or are limited to a particular application domain, without possibilities to easily change the target application or domain. In this paper, we present a pipeline for creation of customized animated 3D content on the web. The pipeline uses rule-based representation of 3D content activities, which are composed into more complex animations. Animation composition is performed on-demand, using queries describing requirements in an arbitrary application domain. The use of knowledgerepresentation adapts the approach to the current trends in the evolution of the web, including the semantic web. It enables exploration by reasoning on the content generated with users' queries. Furthermore, it permits inference of tacit properties of animations from explicitly specified properties, thereby liberating the authors from specifying all necessary animation properties. The pipeline leverages an advanced motion capture system, 3D modeling tools and game engines. We have implemented and evaluated a web-based environment for on-demand animation composition. The proposed approach can be successfully used in multiple application areas on the web, in which 3D content components are intensively reconfigured according to requirements of different users.
In this paper we describe a novel approach to programming microcontrollers based on the Arduino platform using Datalog as a clear and concise description language for system behaviors. The application areas of cheap a...
详细信息
In this paper we propose a logic-based language, CLP (AD) which is an instance of the Constraint logicprogramming schema and is a convenient semantic framework to be used for deductive database language with updates....
详细信息
Interpolation is an important property of classical and many non classical logics that has been shown to have interesting applications in computer science and AI. Here we study the Interpolation Property for the propo...
详细信息
We present the first tableau method with an EXPTIME (optimal) complexity for checking satisfiability of a knowledge base in the description logic SHOQ, which extends ALC with transitive roles, hierarchies of roles, no...
详细信息
We present the first tableau method with an EXPTIME (optimal) complexity for checking satisfiability of a knowledge base in the description logic SHOQ, which extends ALC with transitive roles, hierarchies of roles, nominals and quantified number restrictions. The complexity is measured using binary representation for numbers. Our procedure is based on global caching and integer linear feasibility checking.
Connectionist systems such as Radial Basis Function Neural Networks and similar architectures are commonly applied to solve problems of learning relations from available examples. To overcome their limits in clarity o...
详细信息
ISBN:
(纸本)9783540876557
Connectionist systems such as Radial Basis Function Neural Networks and similar architectures are commonly applied to solve problems of learning relations from available examples. To overcome their limits in clarity of representation, they are often interfaced with symbolic rule-based systems, provided that the information they have memorized can be interpreted. In this paper, an automatic implementation of a RBF-like system is presented using only gradual fuzzy rules learned by induction directly from training data. It is then shown that the same formalism, used with type-II truth values, can learn second-order, fuzzy relations.
暂无评论