4513 search results - page 46 / 903 » Logic programming with satisfiability |
89
Voted
CADE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This article describes the first public version of the satisfiability modulo theory (SMT) solver veriT. It is open-source, proof-producing, and complete for quantifier-fr...
JAIR
2008
14 years 10 months ago
2008
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...
STACS
2000
Springer
15 years 1 months ago
2000
Springer
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
105
Voted
EPIA
2009
Springer
15 years 4 months ago
2009
Springer
Logic Programming Update Languages were proposed as an extension of logic programming that allows modeling the dynamics of knowledge bases where both extensional (facts) and intent...
NMR
2004
Springer
15 years 3 months ago
2004
Springer
In Answer Set Programming it is not possible to deduce any conclusion from an inconsistent program (ie: a program that has no model). The same issue occurs in classical logic wher...