Sciweavers

345 search results - page 31 / 69
» Kripke models for classical logic
Sort
View
LPNMR
2007
Springer
14 years 1 months ago
Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
Joohyung Lee, Ravi Palla
BTW
2003
Springer
92views Database» more  BTW 2003»
14 years 28 days ago
A Logical, Transparent Model for Querying Linked XML Documents
Abstract:The W3C XML Linking Language (XLink) provides a powerful means for interlinking XML documents all over the world. While the effects when browsing through linked XML docume...
Wolfgang May, Dimitrio Malheiro
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
13 years 9 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn
AGP
1993
IEEE
13 years 11 months ago
A Note on Logic Programming Fixed-Point Semantics
In this paper, we present an account of classical Logic Programming fixed-point semantics in terms of two standard categorical constructions in which the least Herbrand model is ...
Vladimiro Sassone
IGPL
2006
130views more  IGPL 2006»
13 years 7 months ago
Verifying Temporal Heap Properties Specified via Evolution Logic
Abstract. This paper addresses the problem of establishing temporal properties of programs written in languages, such as Java, that make extensive use of the heap to allocate-and d...
Eran Yahav, Thomas W. Reps, Shmuel Sagiv, Reinhard...