Sciweavers

446 search results - page 14 / 90
» Automating Theories in Intuitionistic Logic
Sort
View
LANMR
2004
13 years 9 months ago
Computing Preferred Safe Beliefs
We recently proposed a definition of a language for nonmonotonic reasoning based on intuitionistic logic. Our main idea is a generalization of the notion of answer sets for arbitr...
Luis A. Montiel, Juan A. Navarro
LICS
2010
IEEE
13 years 5 months ago
On the Strictness of the First-Order Quantifier Structure Hierarchy over Finite Structures
One of the major interests of finite model theory is to separate the expressive power of different logics or fragments of logics. In this paper, we define a variant of EhrenfeuchtF...
Yuguo He
CADE
2000
Springer
14 years 1 days 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