265 search results - page 15 / 53 » Weakly Algebraizable Logics |
97
Voted
CADE
1997
Springer
15 years 5 months ago
1997
Springer
In this paper we study the completeness of resolution when it is restricted by a non-liftable order and by weak subsumption. A non-liftable order is an order that does not satisfy...
175
Voted
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Contemporary use of the term ’intension’ derives from the traditional logical Frege-Russell’s doctrine that an idea (logic formula) has both an extension and an intension. Al...
102
click to vote
ESWS
2009
Springer
15 years 8 months ago
2009
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasonin...
118
click to vote
LPNMR
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
109
Voted
DEON
2004
Springer
15 years 7 months ago
2004
Springer
This paper studies the logic of a dyadic modal operator for being obliged to meet a condition ρ before a condition δ becomes true. Starting from basic intuitions we arrive at a s...