Sciweavers

1020 search results - page 37 / 204
» Tight Semantics for Logic Programs
Sort
View
OWLED
2007
13 years 10 months ago
Reasoning with OWL-DL in Inductive Logic Programming
The use of background knowledge and the adoption of Horn clausal logic as a knowledge representation and reasoning framework are the distinguishing features of Inductive Logic Prog...
Francesca A. Lisi
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 8 months ago
Propositional theories are strongly equivalent to logic programs
In this paper we show that an arbitrary propositional theory, when interpreted under the answer sets semantics (called Equilibrium Logic for this general syntax), can always be re...
Pedro Cabalar, Paolo Ferraris
AMAI
2008
Springer
13 years 9 months ago
Integrating answer set programming and constraint logic programming
We introduce a knowledge representation language AC(C) extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, ACsolver, ...
Veena S. Mellarkod, Michael Gelfond, Yuanlin Zhang
CORR
2011
Springer
180views Education» more  CORR 2011»
13 years 3 months ago
Representing First-Order Causal Theories by Logic Programs
Nonmonotonic causal logic, introduced by Norman McCain and Hudson Turner, became a basis for the semantics of several expressive action languages. McCain’s embedding of definit...
Paolo Ferraris, Joohyung Lee, Yuliya Lierler, Vlad...
LPNMR
2004
Springer
14 years 2 months ago
Towards Automated Integration of Guess and Check Programs in Answer Set Programming
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
Thomas Eiter, Axel Polleres