Sciweavers

261 search results - page 33 / 53
» Proof Normalization Modulo
Sort
View
APAL
2010
129views more  APAL 2010»
13 years 8 months ago
Kripke models for classical logic
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the meaning of the new notion and its a...
Danko Ilik, Gyesik Lee, Hugo Herbelin
CAGD
2006
72views more  CAGD 2006»
13 years 8 months ago
Inherently improper surface parametric supports
We identify a class of monomial supports that are inherently improper because any surface rational parametrization defined on them is improper. A surface support is inherently imp...
Eng-Wee Chionh, Xiao-Shan Gao, Liyong Shen
IGPL
2007
45views more  IGPL 2007»
13 years 8 months ago
On Positive Relational Calculi
We discuss the question of inclusions between positive relational terms and some of its aspects, using the form of a dialogue. Two possible approaches to the problem are emphasize...
Renata P. de Freitas, Paulo A. S. Veloso, Sheila R...
AGP
1995
IEEE
14 years 23 hour ago
A Prolog Implementation of Kem
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
Alberto Artosi, Paola Cattabriga, Guido Governator...
SIAMCOMP
2002
112views more  SIAMCOMP 2002»
13 years 8 months ago
The Efficiency of Resolution and Davis--Putnam Procedures
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...