Theoretical Computer Science
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
On the relationship between circumscription and negation as failure
Artificial Intelligence
Logic programs with classical negation
Logic programming
Relating minimal models and pre-requisite-free normal defaults
Information Processing Letters
Implementing stable semantics by linear programming
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
Extended logic programs as autoepistemic theories
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
Reflexive autoepistemic logic and logic programming
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
Theory of partial-order programming
Science of Computer Programming
Aggregation and negation-as-failure
New Generation Computing
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
Is Logic Really Dead or Only Just Sleeping?
Proceedings of the 17th International Conference on Logic Programming
Fages' Theorem for Programs with Nested Expressions
Proceedings of the 17th International Conference on Logic Programming
Debugging in A-Prolog: A Logical Approach
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Equivalence in Answer Set Programming
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Inferring acceptable arguments with Answer Set Programming
ENC '05 Proceedings of the Sixth Mexican International Conference on Computer Science
Updates in answer set programming: An approach based on basic structural properties
Theory and Practice of Logic Programming
Open answer set programming with guarded programs
ACM Transactions on Computational Logic (TOCL)
Preferred extensions as stable models*
Theory and Practice of Logic Programming
The Logical Consequence Role in LPNMR: A Parameterized Computation Approach
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Answer set general theories and preferences
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Modality argumentation programming
MDAI'06 Proceedings of the Third international conference on Modeling Decisions for Artificial Intelligence
First-order extension of the FLP stable model semantics via modified circumscription
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Possibilistic intermediate logic
International Journal of Advanced Intelligence Paradigms
Hi-index | 0.00 |
We present some applications of intermediate logics in the field of Answer Set Programming (ASP). A brief, but comprehensive introduction to the answer set semantics, intuitionistic and other intermediate logics is given. Some equivalence notions and their applications are discussed. Some results on intermediate logics are shown, and applied later to prove properties of answer sets. A characterization of answer sets for logic programs with nested expressions is provided in terms of intuitionistic provability, generalizing a recent result given by Pearce. It is known that the answer set semantics for logic programs with nested expressions may select non-minimal models. Minimal models can be very important in some applications, therefore we studied them; in particular we obtain a characterization, in terms of intuitionistic logic, of answer sets which are also minimal models. We show that the logic G3 characterizes the notion of strong equivalence between programs under the semantic induced by these models. Finally we discuss possible applications and consequences of our results. They clearly state interesting links between ASP and intermediate logics, which might bring research in these two areas together.