74 search results - page 14 / 15 » The Complexity of Reasoning for Fragments of Autoepistemic L... |
LICS
2003
IEEE
15 years 4 months ago
2003
IEEE
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
118
click to vote
JELIA
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
CADE
2009
Springer
16 years 6 days ago
2009
Springer
Scalable handling of real arithmetic is a crucial part of the verification of hybrid systems, mathematical algorithms, and mixed analog/digital circuits. Despite substantial advanc...
ICLP
1999
Springer
15 years 3 months ago
1999
Springer
This paper presents a programming language that includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (funct...
169
click to vote
ICLP
2009
Springer
16 years 7 days ago
2009
Springer
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...