Sciweavers

23 search results - page 4 / 5
» Normal Natural Deduction Proofs (in classical logic)
Sort
View
DLOG
2007
14 years 12 months ago
A Constructive Semantics for ALC
One of the main concerns of constructive semantics is to provide a computational interpretation for the proofs of a given logic. In this paper we introduce a constructive semantics...
Loris Bozzato, Mauro Ferrari, Camillo Fiorentini, ...
LFCS
2007
Springer
15 years 3 months ago
Cut Elimination in Deduction Modulo by Abstract Completion
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
Guillaume Burel, Claude Kirchner
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
15 years 1 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
PODS
1997
ACM
124views Database» more  PODS 1997»
15 years 1 months ago
Languages for Relational Databases over Interpreted Structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
RELMICS
2000
Springer
15 years 1 months ago
A Decision Method for Duration Calculus
Abstract: The Duration Calculus is an interval logic introduced for designing realtime systems. This calculus is able to capture important real-time problems like the speci cation ...
Nathalie Chetcuti-Sperandio, Luis Fariñas d...