A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report
[article]
2002
arXiv
pre-print
Preserved Fulltext
In this paper, we take up this challenge and provide a polynomial translation of logic programs with nested expressions into disjunctive logic programs. ...
This is of great practical relevance since it allows us to evaluate nested logic programs by means of off-the-shelf disjunctive logic programming systems, like DLV. ...
This allows us, for instance, to translate, in a semantics-preserving way, arbitrary program parts and leave the remaining program unaffected. ...
arXiv:cs/0207071v1
fatcat:hkxfqvvg25hzba3db7qg26vk54
A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we take up this challenge and provide a polynomial translation of logic programs with nested expressions into disjunctive logic programs. ...
This is of great practical relevance since it allows us to evaluate nested logic programs by means of off-the-shelf disjunctive logic programming systems, like DLV. ...
( U u R
Conclusion We have developed a translation of logic programs with nested expressions into disjunctive logic programs. ...
doi:10.1007/3-540-45619-8_28
fatcat:mbmnbhpqrzeqrloa23bly73f6e
Characterising equilibrium logic and nested logic programs: Reductions and complexity,
2009
Theory and Practice of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In this paper, we present polynomial reductions of the main reasoning tasks associated with equilibrium logic and nested logic programs intoquantified propositional logic, an extension of classical propositional ...
We provide reductions not only for decision problems, but also for the central semantical concepts of equilibrium logic and nested logic programs. ...
A polynomial translation from nested logic programs to disjunctive ones has been realised by Pearce et al. (2002) , based on a labelling technique and exploiting a translation from generalised disjunctive ...
doi:10.1017/s147106840999010x
fatcat:4qwun6nfb5ctdpxdmnnulw5nmu
Answer Set Programming
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Answer Set Programming (ASP), referred to also as Disjunctive Logic Programming under the stable model semantics (DLP), is a powerful formalism for Knowledge Representation and Reasoning. ...
The Italian logic programming community has been very active in this area, some ASP results achieved in Italy are widely recognized as milestones on the road to the current state of the art. ...
Finally, an algorithm which translates NFN programs into ASP programs is provided. ...
doi:10.1007/978-3-642-14309-0_8
fatcat:m7vjxp43qfbgjpujf7ozr72x5q
Logic programs with propositional connectives and aggregates
[article]
2008
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Our definition of an aggregate combines expressiveness and simplicity, and it inherits many theorems about programs with nested expressions, such as theorems about strong equivalence and splitting. ...
Answer set programming (ASP) is a logic programming paradigm that can be used to solve complex combinatorial search problems. ...
Acknowledgements We thank Vladimir Lifschitz for many useful comments on a draft of this paper. ...
arXiv:0812.1462v1
fatcat:we5bixcouff4xocyqdudhshfqi
Abduction from logic programs: Semantics and complexity
1997
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Abduction ~ from observations and a theory, find using hypotheses an explanation for the * Corresponding ...
In particular, Section 3.2 was proposed by a referee; it greatly improves understanding of the relationships between the different abduction problems investigated, and simplified proofs. ...
Acknowledgements The authors would like to thank the referees for their valuable and instructive comments that helped to improve the presentation of this paper. ...
doi:10.1016/s0304-3975(96)00179-x
fatcat:tks5uin32fcxhibfmrrar54fqu
Answer Set Programming Based on Propositional Satisfiability
2006
Journal of automated reasoning
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a SAT-based procedure, called ASP-SAT, that (i) deals with any (non disjunctive) logic program, (ii) works on a propositional formula without additional variables (except for ...
All these reductions either are limited to a subclass of logic programs, or introduce new variables, or may produce exponentially bigger propositional formulas. ...
to Esra Erdem and Keijo Heljanko for providing us with the benchmarks; and to Francesco Calimeri for his support on dlv. ...
doi:10.1007/s10817-006-9033-2
fatcat:65qcwxsp5fgknlqtrl6vbfqwoy
Logic programming with social features
[article]
2008
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
The proposed semantics is shown to be translatable into stable model semantics of logic programs with aggregates. ...
In this paper we focus on a knowledge representation language derived from logic programming which both supports the representation of mental states of individual communities and provides each with the ...
The proposed semantics is shown to be translatable into stable model semantics of logic programs with aggregates. ...
arXiv:0805.3518v1
fatcat:n4te46jg2faonnxwwvpo24qpsq
FO(FD): Extending classical logic with rule-based fixpoint definitions
2010
Theory and Practice of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
AbstractWe introduce fixpoint definitions, a rule-based reformulation of fixpoint constructs. The logic FO(FD), an extension of classical logic with fixpoint definitions, is defined. ...
The satisfiability problem for FO(FD) is investigated by first reducing FO(FD) to difference logic and then using solvers for difference logic. ...
Parity games can be expressed in fixpoint logic, the nesting increasing polynomially with the number of priorities. ...
doi:10.1017/s1471068410000293
fatcat:hr24fq33hvbl7ibbg2w4rcpgwq
Semantical characterizations and complexity of equivalences in answer set programming
2007
ACM Transactions on Computational Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our results, which naturally extend to answer set semantics for programs with strong negation, complement the results on strong equivalence of logic programs and pave the way for optimizations in answer ...
This property strengthens the equivalence of P and Q with respect to answer sets (which is the particular case for R = ∅), and has its applications in program optimization, verification, and modular logic ...
We are also grateful to the anonymous reviewers of ICLP 2003 and JELIA 2004 for their comments on submissions of extended abstracts preliminary to this article, as well as to the anonymous reviewers of ...
doi:10.1145/1243996.1244000
fatcat:m4on4rcfkjd7ff7emsd4koxsdq
Implementing Default and Autoepistemic Logics via the Logic of GK
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, for the first time, we show how the logic of GK can be embedded into disjunctive logic programming in a polynomial but non-modular translation with new variables. ...
The logic of knowledge and justified assumptions, also known as logic of grounded knowledge (GK), was proposed by Lin and Shoham as a general logic for nonmonotonic reasoning. ...
A logic program with nested expressions is a finite set of rules of the form F ← G, where F and G are nested expressions. ...
arXiv:1405.0809v1
fatcat:3s4z6qh4mbggrl3wyvvzjxr2r4
Semantics and complexity of recursive aggregates in answer set programming
2011
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
(disjunctive logic programming -DLP). ...
In this paper we define a semantics for programs with arbitrary aggregates (including monotone, antimonotone, and nonmonotone aggregates) in the full ASP language allowing also for disjunction in the head ...
Acknowledgements This work has greatly benefited from interesting discussions with and comments of Paolo Ferraris, Michael Gelfond, Vladimir Lifschitz, Nikolay Pelov. ...
doi:10.1016/j.artint.2010.04.002
fatcat:ne4yxukwcza2pauef3cntd6goe
Semantical Characterizations and Complexity of Equivalences in Answer Set Programming
[article]
2005
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Our results, which naturally extend to answer set semantics for programs with strong negation, complement the results on strong equivalence of logic programs and pave the way for optimizations in answer ...
This notion, which is well known in the area of deductive databases, is particularly useful for assessing whether programs P and Q are equivalent as components of a logic program which is modularly structured ...
We are also grateful to the anonymous reviewers of ICLP 2003 and JELIA 2004. Their comments on submissions preliminary to this article helped to improve this work, as well. ...
arXiv:cs/0502078v1
fatcat:7itqu6ujenatdozans3wz7zes4
Complete functional synthesis
2010
Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation - PLDI '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To integrate synthesis into programming languages, synthesis algorithms should behave in a predictable way-they should succeed for a well-defined class of specifications. ...
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. ...
synthesis, Martin Odersky for useful discussions on pattern matching in Scala, and Friedrich Eisenbrand for pointers to integer linear programming in fixed dimensions. ...
doi:10.1145/1806596.1806632
dblp:conf/pldi/KuncakMPS10
fatcat:upm5g6rjxzhr5my43q4b2zzkii
A progression semantics for first-order logic programs
2017
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Simply enough, in the progression semantics, a first-order structure M is a stable model of a first-order normal logic program Π if and only if it is the fixed point of the progression of Π with respect ...
In this paper, we propose a progression semantics for first-order normal logic programs, and show that it coincides with the stale model (answer set) semantics. ...
Foundations of Databases. Addison-Wesley, 1995. ...
doi:10.1016/j.artint.2017.06.001
fatcat:xbhyc7nlxjconkdvy6a52fy4ca
« Previous
Showing results 1 — 15 out of 742 results