725 search results - page 16 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
128
Voted
ECAI
1998
Springer
15 years 6 months ago
1998
Springer
We present probabilistic logic programming under inheritance with overriding. This approach is based on new notions of entailment for reasoning with conditional constraints, which...
95
Voted
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
We study the complexity of the propositional minimal inference problem. Its complexity has been extensively studied before because of its fundamental importance in artificial int...
142
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this ar...
105
Voted
KR
1994
Springer
15 years 6 months ago
1994
Springer
In this paper we describe REVISE, an extended logic programming system for revising knowledge bases. REVISE is based on logic programming with explicit negation, plus a two-valued...
151
Voted
NMR
2004
Springer
15 years 7 months ago
2004
Springer
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...