4513 search results - page 24 / 903 » Logic programming with satisfiability |
CAV
2012
Springer
13 years 14 days ago
2012
Springer
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
LPNMR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Nested logic programs and epistemic logic programs are two important extensions of answer set programming. However, the relationship between these two formalisms is rarel...
LATA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
ECAI
2004
Springer
15 years 1 months ago
2004
Springer
In this paper, we tackle the satisfiability problem for multi-context systems. First, we establish a satisfiability algorithm based on an encoding into propositional logic. Then, w...
LOGCOM
2006
14 years 10 months ago
2006
The Alternating-time Temporal Logic (ATL) of Alur, Henzinger, and Kupferman is being increasingly widely applied in the specification and verification of open distributed systems ...