4513 search results - page 407 / 903 » Logic programming with satisfiability |
159
click to vote
BIRTHDAY
1997
Springer
15 years 9 months ago
1997
Springer
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
128
click to vote
CADE
1997
Springer
15 years 8 months ago
1997
Springer
In this paper we study the completeness of resolution when it is restricted by a non-liftable order and by weak subsumption. A non-liftable order is an order that does not satisfy...
129
click to vote
ENTCS
2008
15 years 5 months ago
2008
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...
135
click to vote
LOGCOM
2010
15 years 3 months ago
2010
A theory of infinitary deduction systems is developed for the modal logic of coalgebras for measurable polynomial functors on the category of measurable spaces. These functors ha...
133
click to vote
FSTTCS
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, we address the verification problem of ordered multi-pushdown systems: A multistack extension of pushdown systems that comes with a constraint on stack operations s...