2585 search results - page 428 / 517 » Automating Coherent Logic |
104
click to vote
CSL
2009
Springer
15 years 7 months ago
2009
Springer
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
116
click to vote
CSL
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. For a two-variable formula B(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of a finite-state operator Y=F(X) ...
120
click to vote
LOPSTR
2009
Springer
15 years 7 months ago
2009
Springer
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
109
click to vote
LPNMR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with n...
106
click to vote
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
We present a syntax for MALL (multiplicative additive linear logic without units) proof nets which refines Girard’s one. It is also based on the use of monomial weights for ide...