499 search results - page 23 / 100 » Logic Programming in a Fragment of Intuitionistic Linear Log... |
169
click to vote
CONCUR
2011
Springer
14 years 4 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...
162
click to vote
AIML
2004
15 years 5 months ago
2004
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
154
click to vote
RR
2009
Springer
15 years 11 months ago
2009
Springer
Open Answer Set Programming (OASP) can be seen as a framework to represent tightly integrated combined knowledge bases of ontologies and rules that are not necessarily DL-safe. The...
166
click to vote
LOGCOM
2007
15 years 4 months ago
2007
We provide algebraic semantics together with a sound and complete sequent calculus for information update due to epistemic actions. This semantics is flexible enough to accommoda...
139
click to vote
WOLLIC
2010
Springer
15 years 9 months ago
2010
Springer
The satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting were shown in [5] to be in NExpTime. This paper presents ...