903 search results - page 120 / 181 » Completeness Results for Memory Logics |
262
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
181
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
We present a new calculus for first-order theorem proving with equality, ME+Sup, which generalizes both the Superposition calculus and the Model Evolution calculus (with equality)...
174
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
Abstract. In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equ...
173
click to vote
VL
2007
IEEE
16 years 18 days ago
2007
IEEE
Spider diagrams are a visual logic capable of makeing statements about relationships between sets and their cardinalities. Various meta-level results for spider diagrams have been...
155
click to vote
CSL
2007
Springer
16 years 15 days ago
2007
Springer
A game semantics of the (−−∗, →)-fragment of the logic of bunched implications, BI, is presented. To date, categorical models of BI have been restricted to two kinds: funct...