Data integration is the problem of combining the data residing at different sources, and providing a unified view of these data, called global schema, which can be queried by the user. the interest in this kind of sys...
详细信息
We present a method to learn simultaneously definitions for a concept and its negation. this problem is relevant when we have to deal with a complex domain where it is difficult to acquire a complete theory and where ...
详细信息
We present an implementation of an answer-set programming paradigm, called aspps (short for answer-set programming with propositional schemata). the system aspps is designed to process PS-theories. It consists of two ...
详细信息
this paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logic program, preference information is expressed...
详细信息
NoMoRe implements answer set semantics for normal logic programs. It realizes a novel paradigm to compute answer sets by computing a-colorings (non-standard graph colorings with two colors) of the block graph (a label...
ISBN:
(纸本)3540425934
NoMoRe implements answer set semantics for normal logic programs. It realizes a novel paradigm to compute answer sets by computing a-colorings (non-standard graph colorings with two colors) of the block graph (a labeled digraph) associated with a given program P (see [5] for details). Intuitively, an a-coloring reflects the set of generating rules for an answer set, which means that noMoRe is rule-based and not atom-based like most of the other known systems. Since the core system was designed for propositional programs only, we have integrated lparse [8] as a grounder in order to deal with variables. Furthermore, we have included an interface to the graph drawing tool DaVinci [6] for visualization of block graphs. this allows for a structural analysis of programs.
Multi-adjoint logic programs has been recently introduced [9, 10] as a generalization of monotonic logic programs [2, 3], in that simultaneous use of several implications in the rules and rather general connectives in...
详细信息
logic programs P and Q are strongly equivalent if, given any logic program R, programs P ∩ R and Q ∩ R are equivalent (that is, have the same answer sets). Strong equivalence is convenient for the study of equivalen...
详细信息
We investigate the relationship amongst some solutions to the frame problem. We encode Pednault's syntax-based solution [20], Baker's state-minimization policy [1], and Gelfond & Lifchitz's Action Lang...
详细信息
Schlipf [Sch95] proved that Stable logicprogramming (SLP) solves all NP decision problems. We extend Schlipf's result to prove that SLP solves all search problems in the class NP. Moreover, we do this in a unifor...
详细信息
In this paper we present a declarative approach to adding domain-dependent control knowledge for Answer Set Planning (ASP). Our approach allows different types of domain-dependent control knowledge such as hierarchica...
详细信息
暂无评论