4573 search results - page 596 / 915 » Automated Reasoning |
142
click to vote
CADE
2006
Springer
16 years 4 months ago
2006
Springer
In this paper, we discuss a lightweight approach to eliminate the overhead due to implicit type arguments during higher-order unification of dependently-typed terms. First, we show...
126
click to vote
CADE
2006
Springer
16 years 4 months ago
2006
Springer
We investigate whether identification constraints such as keys and functional dependencies can be granted full status as a concept constructor in a Boolean-complete description log...
140
click to vote
CADE
2005
Springer
16 years 4 months ago
2005
Springer
In this paper we study the decidability of various fragments of monodic first-order temporal logic by temporal resolution. We focus on two resolution calculi, namely, monodic tempo...
168
click to vote
CADE
2005
Springer
16 years 4 months ago
2005
Springer
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
159
click to vote
CADE
2005
Springer
16 years 4 months ago
2005
Springer
We present a combination method for generating interpolants for a class of first-order theories. Using interpolant-generation procedures for individual theories as black-boxes, our...