254 search results - page 7 / 51 » Answer Sets for Propositional Theories |
CADE
1997
Springer
13 years 12 months ago
1997
Springer
Abstract. We present a technique that efficiently translates propositional intuitionistic formulas into propositional classical formulas. This technique allows the use of arbitrary...
JELIA
2010
Springer
13 years 6 months ago
2010
Springer
In previous work, the so-called Temporal Equilibrium Logic (TEL) was introduced. This formalism provides an extension of the Answer Set semantics for logic programs to arbirary the...
AAAI
2006
13 years 9 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
In a peer-to-peer inference system, there is no centralized control or hierarchical organization: each peer is equivalent in functionality and cooperates with other peers in order...
NMR
2004
Springer
14 years 1 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...