2585 search results - page 219 / 517 » Automating Coherent Logic |
134
click to vote
CSL
2000
Springer
15 years 11 months ago
2000
Springer
In the ambient logic of classical second order propositional calculus, we solve the specification problem for a family of excluded middle like tautologies. These are shown to be r...
162
click to vote
ICLP
1999
Springer
15 years 10 months ago
1999
Springer
In this work, we develop a binding-time analysis for the logic programming language Mercury. We introduce a precise domain of binding-times, based on the type information available...
219
click to vote
ELP
1993
15 years 10 months ago
1993
The logic of definitional reflection is extended with a theory of free equality. Based on this equality theory a sequent-style notion of the completion of a definition is motivated...
161
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...
133
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
The synthesis of reactive systems requires the solution of two-player games on graphs with -regular objectives. When the objective is specified by a linear temporal logic formula o...