2022 search results - page 12 / 405 » Complexity of Non-Monotonic Logics |
ECCC
2006
14 years 10 months ago
2006
We formulate a formal syntax of approximate formulas for the logic with counting quantifiers, SOLP, studied by us in [1], where we showed the following facts: (i) In the presence ...
ECAI
1992
Springer
15 years 2 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
TIME
2005
IEEE
15 years 3 months ago
2005
IEEE
A clausal resolution approach originally developed for the branching logic CTL has recently been extended to the logics ECTL and ECTL+ . In the application of the resolution rules...
CSL
2008
Springer
14 years 12 months ago
2008
Springer
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...