247 search results - page 10 / 50 » Logic Programming Approach to Automata-Based Decision Proced... |
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...
92
Voted
LPNMR
2001
Springer
15 years 2 months ago
2001
Springer
Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, no consensus has been reac...
FOSSACS
2006
Springer
15 years 1 months ago
2006
Springer
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
CADE
2009
Springer
15 years 10 months 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...
LPNMR
1997
Springer
15 years 1 months ago
1997
Springer
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...