Sciweavers

414 search results - page 36 / 83
» Resolution for Intuitionistic Logic
Sort
View
119
Voted
JAR
2011
60views more  JAR 2011»
14 years 10 months ago
Resolution with Order and Selection for Hybrid Logics
Carlos Areces, Daniel Gorín
CADE
2006
Springer
16 years 4 months ago
Geometric Resolution: A Proof Procedure Based on Finite Model Search
We present a proof procedure that is complete for first-order logic, but which can also be used when searching for finite models. The procedure uses a normal form which is based on...
Hans de Nivelle, Jia Meng
138
Voted
ZUM
2000
Springer
15 years 7 months ago
A Computation Model for Z Based on Concurrent Constraint Resolution
We present a computation model for Z, which is based on a reduction to a small calculus, called Z, and on concurrent constraint resolution techniques applied for computing in thi...
Wolfgang Grieskamp
TIME
1994
IEEE
15 years 8 months ago
Using Constrained Resolution for Abductive Temporal Reasoning
We describe in this article an abductive procedure based on a constrained resolution principle. The choice of constrained resolution is motivated by the whish to gain full advanta...
Nicolas Chleq