Sciweavers

338 search results - page 1 / 68
» Soundness and Completeness of a Logic Programming Approach t...
Sort
View
AAAI
1994
13 years 6 months ago
Soundness and Completeness of a Logic Programming Approach to Default Logic
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...
Grigoris Antoniou, Elmar Langetepe
IJCAI
1989
13 years 6 months ago
Logic Programming with General Clauses and Defaults Based on Model Elimination
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
Marco A. Casanova, Ramiro A. de T. Guerreiro, Andr...
AMAI
2006
Springer
13 years 4 months ago
Strong and uniform equivalence of nonmonotonic theories - an algebraic approach
We show that the concepts of strong and uniform equivalence of logic programs eneralized to an abstract algebraic setting of operators on complete lattices. Our results imply char...
Miroslaw Truszczynski
LPNMR
1999
Springer
13 years 9 months ago
A Comparison of Sceptical NAF-Free Logic Programming Approaches
Recently there has been increased interest in logic programming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, defau...
Grigoris Antoniou, Michael J. Maher, David Billing...
JAIR
2008
104views more  JAIR 2008»
13 years 4 months ago
Sound and Complete Inference Rules for SE-Consequence
The notion of strong equivalence on logic programs with answer set semantics gives rise to a consequence relation on logic program rules, called SE-consequence. We present a sound...
Ka-Shu Wong