Sciweavers

414 search results - page 26 / 83
» Resolution for Intuitionistic Logic
Sort
View
APAL
2006
107views more  APAL 2006»
13 years 7 months ago
Frege systems for extensible modal logics
By a well-known result of Cook and Reckhow [4, 12], all Frege systems for the Classical Propositional Calculus (CPC) are polynomially equivalent. Mints and Kojevnikov [11] have re...
Emil Jerábek
EUSFLAT
2007
154views Fuzzy Logic» more  EUSFLAT 2007»
13 years 9 months ago
Resolution Strategies for Fuzzy Description Logic
The paper presents experimental comparison of several resolution strategies for reasoning in Fuzzy Description Logic based on Fuzzy Predicate Logic with evaluated syntax. Resoluti...
Hashim Habiballa
CADE
1998
Springer
13 years 12 months ago
Automated Theorem Proving in a Simple Meta-Logic for LF
Abstract. Higher-order representation techniques allow elegant encodings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally i...
Carsten Schürmann, Frank Pfenning
ASIAN
2006
Springer
91views Algorithms» more  ASIAN 2006»
13 years 11 months ago
A Type-Theoretic Framework for Formal Reasoning with Different Logical Foundations
Abstract. A type-theoretic framework for formal reasoning with different logical foundations is introduced and studied. With logic-enriched type theories formulated in a logical fr...
Zhaohui Luo
CADE
2000
Springer
13 years 12 months ago
Automated Proof Construction in Type Theory Using Resolution
We provide techniques to integrate resolution logic with equality in type theory. The results may be rendered as follows. − A clausification procedure in type theory, equipped w...
Marc Bezem, Dimitri Hendriks, Hans de Nivelle