Sciweavers

4513 search results - page 310 / 903
» Logic programming with satisfiability
Sort
View
PPDP
2007
Springer
15 years 10 months ago
Relational semantics for effect-based program transformations with dynamic allocation
We give a denotational semantics to a region-based effect system tracking reading, writing and allocation in a higher-order language with dynamically allocated integer references....
Nick Benton, Andrew Kennedy, Lennart Beringer, Mar...
CSL
2005
Springer
15 years 10 months ago
L-Nets, Strategies and Proof-Nets
We consider the setting of L-nets, recently introduced by Faggian and Maurel as a game model of concurrent interaction and based on Girard’s Ludics. We show how L-nets satisfying...
Pierre-Louis Curien, Claudia Faggian
FSTTCS
2009
Springer
15 years 8 months ago
Synthesis of Finite-state and Definable Winning Strategies
ABSTRACT. Church's Problem asks for the construction of a procedure which, given a logical specification on sequence pairs, realizes for any input sequence I an output sequen...
Alexander Rabinovich
DLOG
2008
15 years 6 months ago
Checking DL-Lite Modularity with QBF Solvers
We show how the reasoning tasks of checking various versions of conservativity for the description logic DL-Litebool can be reduced to satisfiability of quantified Boolean formulas...
Roman Kontchakov, Vladislav Ryzhikov, Frank Wolter...
TPLP
2002
117views more  TPLP 2002»
15 years 4 months ago
On Properties of Update Sequences Based on Causal Rejection
In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. In this approach, new informat...
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Ha...