We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, features that are present in most DLs. The extended ...
详细信息
We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, features that are present in most DLs. The extended language, conceptual logic programming (CLP) proves to be a viable alternative for intuitively representing and reasoning nonmonotonically, in a decidable way, with possibly infinite knowledge. Not only can conceptual logic programs (CLPs) simulate finite answer set programming, they are also flexible enough to simulate reasoning in an expressive class of description logics, thus being able to play the role of ontology language, as well as rule language, on the Semantic Web.
作者：
Lévy, F.LIPN
CNRS-URA 1507 University of Paris Nord Avenue J.B. Clément Villetaneuse93430 France
We propose a notion of weak extension of a default theory, motivated by a kind of paraconsistent view of default reasoning, and which coincides with Reiter’s extensions when they exist. When the default theory is inc...
详细信息
Reactivity is an essential property of a synchronous program. Informally, it guarantees that at each instant the program fed with an input will"react" producing an output. In the present work, we consider a ...
详细信息
In Multi-Agent Path Finding (MAPF), a team of agents needs to find collision-free paths from their starting locations to their respective targets. Combined Target Assignment and Path Finding (TAPF) extends MAPF by inc...
详细信息
ISBN:
(纸本)9780999241103
In Multi-Agent Path Finding (MAPF), a team of agents needs to find collision-free paths from their starting locations to their respective targets. Combined Target Assignment and Path Finding (TAPF) extends MAPF by including the problem of assigning targets to agents as a precursor to the MAPF problem. A limitation of both models is their assumption that the number of agents and targets are equal, which is invalid in some applications. We address this limitation by generalizing TAPF to allow for (1) unequal number of agents and tasks;(2) tasks to have deadlines by which they must be completed;(3) ordering of groups of tasks to be completed;and (4) tasks that are composed of a sequence of checkpoints that must be visited in a specific order. Further, we model the problem using answer set programming (ASP) to show that customizing the desired variant of the problem is simple - one only needs to choose the appropriate combination of ASP rules to enforce it. We also demonstrate experimentally that if problem specific information can be incorporated into the ASP encoding then ASP based methods can be efficient and can scale up to solve practical applications.
We generalize the binary Deutsch-Jozsa algorithm to n-valued logic using the quantum Fourier transform. Our algorithm is not only able to distinguish between constant and balanced Boolean functions in a single query, ...
详细信息
A recent development of a Semantic Web language is OWL 2, an extension of OWL. So far OWL 2 has been designed by W3C as the language for representing a web ontology. Earlier we have developed a meta-logical approach f...
详细信息
The Fifth Generation Computer Project was launched in 1982, aiming at developing parallel computers dedicated to knowledge information processing. It was commonly believed that knowledge processing based on symbolic c...
详细信息
The Fifth Generation Computer Project was launched in 1982, aiming at developing parallel computers dedicated to knowledge information processing. It was commonly believed that knowledge processing based on symbolic computation is very difficult to parallelize. We conjectured that logic programming technology would solve this difficulty. During the project, we succeeded in inventing a parallel logic programming language, GHC, and its realistic extension, KL1. We are now developing a target parallel hardware called PIM, consisting of 512 processing elements. We succeeded in developing PIM's operating system totally in KL1, which runs on Multi-PSI, a current experimental parallel hardware for developing KL1 programming. Using Multi-PSI, we are also developing programming techniques for KL1, and more realistic and complicated application programs such as VLSI CAD systems, genetic information processing, case based reasoning systems and parallel theorem provers which, we hope, will run efficiently on PIM.
We present the first version of our ASP solver ASPeRiX that implements a new approach of answer set computation. The main specifity of our system is to realize a forward chaining of first order rules that are grounded...
详细信息
A smart space is an ecosystem of interacting computational objects embedded in some environment. The space seamlessly provides users with information and services using the best available resources. In this paper, the...
详细信息
暂无评论