446 search results - page 16 / 90 » Automating Theories in Intuitionistic Logic |
DEON
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. In this paper we investigate how to model legal abrogation and annulment in Defeasible Logic. We examine some options that embed in this setting, and similar rule-based s...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
Prominent logics, including quantified multimodal logics, can be elegantly embedded in simple type theory (classical higher-order logic). Furthermore, off-the-shelf reasoning syste...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of ...
LICS
1999
IEEE
13 years 12 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
CADE
2007
Springer
14 years 8 months ago
2007
Springer
Abstract. This paper presents the foundations for using automated deduction technology in static program analysis. The central principle is the use of logical lattices ? a class of...