227 search results - page 20 / 46 » A Model Theory for Paraconsistent Logic Programming |
139
Voted
ECAI
2004
Springer
15 years 10 months ago
2004
Springer
In this work we further investigate the relation, first found by Truszczy´nski, between modal logic S4F and Default Logic (DL), analyzing some interesting properties and showing ...
126
click to vote
SIGSOFT
2005
ACM
16 years 5 months ago
2005
ACM
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...
163
click to vote
TLDI
2009
ACM
16 years 1 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
153
click to vote
POPL
2010
ACM
15 years 5 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
144
click to vote
ATVA
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...