Sciweavers

2022 search results - page 57 / 405
» Complexity of Non-Monotonic Logics
Sort
View
CSL
2009
Springer
15 years 10 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
LICS
1999
IEEE
15 years 10 months ago
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
Albert Atserias, Phokion G. Kolaitis
ICDT
2007
ACM
97views Database» more  ICDT 2007»
16 years 14 days ago
Combining Temporal Logics for Querying XML Documents
Close relationships between XML navigation and temporal logics have been discovered recently, in particular between logics LTL and CTL⋆ and XPath navigation, and between the µ-c...
Marcelo Arenas, Pablo Barceló, Leonid Libki...
ASPDAC
2004
ACM
83views Hardware» more  ASPDAC 2004»
15 years 11 months ago
A procedure for obtaining a behavioral description for the control logic of a non-linear pipeline
Much attention has been directed to different aspects of the design of pipelines [1,2,3,4]. Design of the control logic of non-linear pipelines has however, been considered as a su...
Hashem Hashemi Najaf-abadi
CORR
2008
Springer
89views Education» more  CORR 2008»
15 years 6 months ago
Model Checking Positive Equality-free FO: Boolean Structures and Digraphs of Size Three
We study the model checking problem, for fixed structures A, over positive equality-free first-order logic
Barnaby Martin