2573 search results - page 308 / 515 » Combinations of Modal Logics |
150
click to vote
CADE
1997
Springer
15 years 10 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...
150
click to vote
ISLPED
1995
ACM
15 years 10 months ago
1995
ACM
We present a technique that automatically synthesizes nite state machines with gated clocks to reduce the power dissipation of the nal implementation. We describe a new transfor...
200
click to vote
TABLEAUX
1995
Springer
15 years 10 months ago
1995
Springer
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constra...
162
click to vote
CTRS
1987
15 years 10 months ago
1987
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming...
172
click to vote
ACL
1990
15 years 7 months ago
1990
A user may typically need to combine the strengths of more than one system in order to perform a task. In this paper, we describe a component of the Janus natural language interfa...