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
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Characterization of strongly equivalent logic programs in intermediate logics
Theory and Practice of Logic Programming
Annals of Mathematics and Artificial Intelligence
Propositional theories are strongly equivalent to logic programs
Theory and Practice of Logic Programming
Reducing propositional theories in equilibrium logic to logic programs
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
Hi-index | 0.00 |
We explore the range of propositional logics suitable for logic programs under the stable semantics, starting with the logic of here-and-there as a primary representative. It will be shown, however, that there are other potential logics in the range. Still, all such logics are based on essentially the same semantics, so their differences are largely due to choice of the underlying language. Our representation suggests a more tolerant answer to the question ‘What is the Logic of Logic Programming?', as well as some further expressive opportunities in using logic programs as a general knowledge representation formalism.