Sciweavers

150 search results - page 13 / 30
» Complexity of the Unique Extension Problem in Default Logic
Sort
View
73
Voted
TARK
2007
Springer
15 years 3 months ago
Alternating-time temporal logic with explicit strategies
We introduce ATLES – a variant of ATL with explicit names for strategies in the object language. ATLES makes it possible to refer to the same strategy in different occurrences o...
Dirk Walther, Wiebe van der Hoek, Michael Wooldrid...
ICALP
2009
Springer
15 years 9 months ago
On Regular Temporal Logics with Past,
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
Christian Dax, Felix Klaedtke, Martin Lange
CSL
2009
Springer
15 years 1 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
97
Voted
DBPL
2005
Springer
143views Database» more  DBPL 2005»
15 years 3 months ago
Inconsistency Tolerance in P2P Data Integration: An Epistemic Logic Approach
We study peer-to-peer ðP2PÞ data integration, where each peer models an autonomous system that exports data in terms of its own schema, and data interoperation is achieved by me...
Diego Calvanese, Giuseppe De Giacomo, Domenico Lem...
CONCUR
2011
Springer
13 years 9 months ago
Tractable Reasoning in a Fragment of Separation Logic
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...
Byron Cook, Christoph Haase, Joël Ouaknine, M...