Sciweavers

438 search results - page 33 / 88
» On theorem proving in annotated logics
Sort
View
LPNMR
1997
Springer
15 years 1 months ago
Power Defaults
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
Guo-Qiang Zhang, William C. Rounds
ASIAN
2006
Springer
91views Algorithms» more  ASIAN 2006»
15 years 1 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
SLOGICA
2002
98views more  SLOGICA 2002»
14 years 9 months ago
A Cut-Free Sequent System for the Smallest Interpretability Logic
In [Sas01], it was given a cut-free sequent system for the smallest interpretability logic IL. He first gave a cut-free system for IK4, a sublogic of IL, whose -free fragment is th...
Katsumi Sasaki
LICS
1991
IEEE
15 years 1 months ago
Logic Programming in a Fragment of Intuitionistic Linear Logic
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
Joshua S. Hodas, Dale Miller
FLOPS
2008
Springer
14 years 11 months ago
Termination of Narrowing in Left-Linear Constructor Systems
Narrowing extends rewriting with logic capabilities by allowing free variables in terms and replacing matching with unification. Narrowing has been widely used in different context...
Germán Vidal