Sciweavers

3658 search results - page 79 / 732
» The logic of proofs, semantically
Sort
View
AML
2006
106views more  AML 2006»
15 years 6 months ago
Upper bounds on complexity of Frege proofs with limited use of certain schemata
The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of th...
Pavel Naumov
FLOPS
2008
Springer
15 years 7 months ago
Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation
In this paper, we present an extension of the scheme HH(C) (Hereditary Harrop formulas with Constraints) with a suitable formulation of negation in order to obtain a constraint ded...
Susana Nieva, Jaime Sánchez-Hernánde...
APLAS
2010
ACM
15 years 6 months ago
Reasoning about Computations Using Two-Levels of Logic
We describe an approach to using one logic to reason about specifications written in a second logic. One level of logic, called the "reasoning logic", is used to state th...
Dale Miller
CADE
2006
Springer
16 years 6 months ago
Automatic Termination Proofs in the Dependency Pair Framework
Jürgen Giesl, Peter Schneider-Kamp, Ren&eacut...
KI
1995
Springer
15 years 9 months ago
What Is a Skeptical Proof?
Abstract. We investigate the task of skeptically reasoning in extensionbased, nonmonotonic logics by concentrating on general argumentation theories. The restricted applicability o...
Michael Thielscher