Sciweavers

1588 search results - page 69 / 318
» On the Logic of Constitutive Rules
Sort
View
FOSSACS
2005
Springer
15 years 11 months ago
A Simpler Proof Theory for Nominal Logic
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
James Cheney
AGP
2010
IEEE
15 years 10 months ago
The Transformational Approach to Program Development
We present an overview of the program transformation techniques which have been proposed over the past twenty-five years in the context of logic programming. We consider the appro...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...
CORR
2004
Springer
136views Education» more  CORR 2004»
15 years 6 months ago
Automatic Generation of CHR Constraint Solvers
In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tab...
Slim Abdennadher, Christophe Rigotti
SAT
2009
Springer
121views Hardware» more  SAT 2009»
16 years 22 days ago
The Complexity of Reasoning for Fragments of Default Logic
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...
PEPM
2007
ACM
16 years 9 days ago
Quasi-terminating logic programs for ensuring the termination of partial evaluation
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
Germán Vidal