3776 search results - page 499 / 756 » Partition-Based Logical Reasoning |
99
Voted
TPHOL
1999
IEEE
15 years 6 months ago
1999
IEEE
Gandalf is a first-order resolution theorem-prover, optimized for speed and specializing in manipulations of large clauses. In this paper I describe GANDALF TAC, a HOL tactic that ...
119
click to vote
TPHOL
1997
IEEE
15 years 6 months ago
1997
IEEE
This paper describes the concept of higher order quotients and an implementation in Isabelle. Higher order quotients are a generalization of quotients. They use partial equivalence...
LICS
1994
IEEE
15 years 6 months ago
1994
IEEE
Gregory McColm conjectured that positive elementary inductions are bounded in a class K of nite structures if every (FO + LFP) formula is equivalent to a rst-order formula in K. H...
138
click to vote
LICS
1994
IEEE
15 years 6 months ago
1994
IEEE
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
110
click to vote
ICLP
1990
Springer
15 years 6 months ago
1990
Springer
The logic programming language framework Kernel Andorra Prolog is de ned by a formal computation model. In Kernel Andorra Prolog, general combinations of concurrent reactive langu...