A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
Resolution for quantified Boolean formulas
Information and Computation
Resolution-based theorem proving for many-valued logics
Journal of Symbolic Computation
On different structure-preserving translations to normal form
Journal of Symbolic Computation
On definitional transformations to normal form for intuitionistic logic
Fundamenta Informaticae
An algorithm to evaluate quantified Boolean formulae
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Proceedings of the 1999 international conference on Logic programming
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
Encodings for Equilibrium Logic and Logic Programs with Nested Expressions
EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
On the Effect of Default Negation on the Expressiveness of Disjunctive Rules
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Declarative Specification and Solution of Combinatorial Auctions Using Logic Programming
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Diagnosing Physical Systems in A-Prolog
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Bounded LTL Model Checking with Stable Models
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
A Deductive System for Non-Monotonic Reasoning
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
A Tableau Calculus for Equilibrium Entailment
TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Distributed Algorithm to Evaluate Quantified Boolean Formulae
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Computing Equilibrium Models Using Signed Formulas
CL '00 Proceedings of the First International Conference on Computational Logic
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Improvements to the evaluation of quantified boolean formulae
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Applications of intuitionistic logic in Answer Set Programming
Theory and Practice of Logic Programming
Weight constraints as nested expressions
Theory and Practice of Logic Programming
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2
Theory and Practice of Logic Programming
On the equivalence between answer sets and models of completion for nested logic programs
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Reducing propositional theories in equilibrium logic to logic programs
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
A core language for fuzzy answer set programming
International Journal of Approximate Reasoning
Nested Preferences in Answer Set Programming
Fundamenta Informaticae - Latin American Workshop on Logic Languages, Algorithms and New Methods of Reasoning (LANMR)
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
Hi-index | 0.00 |
Nested logic programs have recently been introduced in order to allow for arbitrarily nested formulas in the heads and the bodies of logic program rules under the answer sets semantics. Previous results show that nestedlogic programs can be transformed into standard (unnested) disjunctive logic programs in an elementary way, applying the negation-as-failure operator to body literals only. This is of great practical relevance since it allows us to evaluate nestedlogic programs by means of off-the-shelf disjunctive logic programming systems, like DLV. However, it turns out that this straightforward transformation results in an exponential blow-up in the worst-case, despite the fact that complexity results indicate that there is a polynomial translation among both formalisms. In this paper, we take up this challenge and provide a polynomial translation of logic programs with nestedex pressions into disjunctive logic programs. Moreover, we show that this translation is modular and(s trongly) faithful. We have implementedb oth the straightforward as well as our advanced transformation; the resulting compiler serves as a front-end to DLV and is publicly available on the Web.