2022 search results - page 35 / 405 » Complexity of Non-Monotonic Logics |
104
Voted
AAAI
2012
13 years 19 days ago
2012
Tractable subsets of first-order logic are a central topic in AI research. Several of these formalisms have been used as the basis for first-order probabilistic languages. Howev...
102
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this ar...
116
click to vote
CONCUR
2011
Springer
13 years 10 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
73
Voted
CADE
1992
Springer
15 years 2 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
73
Voted
IWPEC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We introduce a general notion of miniaturization of a problem that comprises the different miniaturizations of concrete problems considered so far. We develop parts of t...