1916 search results - page 276 / 384 » Reasoning with class algebra |
LORI
2009
Springer
14 years 3 months ago
2009
Springer
Most belief change operators in the AGM tradition assume an underlying plausibility ordering over the possible worlds which is transitive and complete. A unifying structure for the...
IV
2008
IEEE
14 years 3 months ago
2008
IEEE
Given a group of overlapping sets, it is not always possible to represent it with Euler diagrams. Euler diagram characteristics might collide with the sets relationships to depict...
LICS
2008
IEEE
14 years 3 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
LICS
2007
IEEE
14 years 3 months ago
2007
IEEE
In this paper we generalize the contraction method, originally proposed by Elgot and Rabin and later extended by Carton and Thomas, from labeled linear orderings to colored determ...
LICS
2007
IEEE
14 years 3 months ago
2007
IEEE
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...