Sciweavers

247 search results - page 17 / 50
» Stable models and an alternative logic programming paradigm
Sort
View
87
Voted
ICALP
2009
Springer
15 years 12 months ago
B-Treaps: A Uniquely Represented Alternative to B-Trees
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
Daniel Golovin
JAIR
2007
121views more  JAIR 2007»
14 years 11 months ago
On the Semantics of Logic Programs with Preferences
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation fo...
Sergio Greco, Irina Trubitsyna, Ester Zumpano
IJCAI
2001
15 years 1 months ago
Graph Theoretical Characterization and Computation of Answer Sets
We give a graph theoretical characterization of answer sets of normal logic programs. We show that there is a one-to-one correspondence between answer sets and a special, non-stan...
Thomas Linke
107
Voted
ASP
2001
Springer
15 years 4 months ago
Genes and Ants for Default Logic
Default Logic and Logic Programming with stable model semantics are recognized as powerful frameworks for incomplete information representation. Their expressive power are suitabl...
Pascal Nicolas, Frédéric Saubion, Ig...
105
Voted
AMAI
2006
Springer
14 years 11 months ago
A generalization of the Lin-Zhao theorem
The theorem on loop formulas due to Fangzhen Lin and Yuting Zhao shows how to turn a logic program into a propositional formula that describes the program's stable models. In...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz