Sciweavers

414 search results - page 44 / 83
» Resolution for Intuitionistic Logic
Sort
View
FOSSACS
1999
Springer
13 years 12 months ago
A Strong Logic Programming View for Static Embedded Implications
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
R. Arruabarrena, Paqui Lucio, Marisa Navarro
PVLDB
2010
129views more  PVLDB 2010»
13 years 6 months ago
Entity Resolution with Evolving Rules
Entity resolution (ER) identifies database records that refer to the same real world entity. In practice, ER is not a one-time process, but is constantly improved as the data, sc...
Steven Whang, Hector Garcia-Molina
LPAR
2000
Springer
13 years 11 months ago
Encoding Temporal Logics in Executable Z: A Case Study for the ZETA System
Abstract. The ZETA system is a Z-based tool environment for developing formal specifications. It contains a component for executing the Z language based on the implementation techn...
Wolfgang Grieskamp, Markus Lepper
CSR
2006
Springer
13 years 11 months ago
Extended Resolution Proofs for Conjoining BDDs
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applic...
Carsten Sinz, Armin Biere
CADE
1997
Springer
13 years 11 months ago
A Classification of Non-liftable Orders for Resolution
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...
Hans de Nivelle