Add to ORKGInf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics: we defined inf-Datalog and characterized the expressive power of various fragments of inf-Datalog in [GFAA03]. In the present paper, we study the complexity of query evaluation on finite models for (various fragments of) inf-Datalog. We deduce a unified and elementary proof that global model-checking (i.e. computing all nodes satisfying a formula in a given structure) has 1. quadratic data complexity in time and linear program complexity in space for CTL and alternation-free modal µ-calculus, and 2. linearspace (data and program) complexities, linear-time program complexity and polynomial-time data complexity for Lµk (modal µ-calculus with fi...
This book presents the main results of descriptive complexity theory, that is, the connections betwe...
The study of inconsistency-tolerant semantics for query answering in ontological languages has recen...
AbstractWe present here a depth-bounded bottom-up evaluation algorithm for logic programs. We show t...
Inf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics...
In [11] we defined Inf-Datalog and characterized the fragments of Monadic inf-Datalog that have the ...
Abstract. We study the data complexity of the modal query language MDatalog and its extension eMData...
We study the program complexity of datalog on both finite and infinite linearorders. Our main result...
Mathematical logic and computational complexity have close connections that can be traced to the roo...
Mathematical logic and computational complexity have close connections that can be traced to the roo...
The parameterized model-checking problem for a class of first-order sentences (queries) asks to deci...
We study the data complexity of reasoning for several fragments of MTL - an extension of Datalog wit...
Abstract. Higher Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal...
AbstractWe study here the language Datalog(≠), which is the query language obtained from Datalog by ...
AbstractIn this paper we study a generalization of datalog, the language of function-free definite c...
We introduce a new approach to implicit complexity in linear logic, inspired by functional database ...
This book presents the main results of descriptive complexity theory, that is, the connections betwe...
The study of inconsistency-tolerant semantics for query answering in ontological languages has recen...
AbstractWe present here a depth-bounded bottom-up evaluation algorithm for logic programs. We show t...
Inf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics...
In [11] we defined Inf-Datalog and characterized the fragments of Monadic inf-Datalog that have the ...
Abstract. We study the data complexity of the modal query language MDatalog and its extension eMData...
We study the program complexity of datalog on both finite and infinite linearorders. Our main result...
Mathematical logic and computational complexity have close connections that can be traced to the roo...
Mathematical logic and computational complexity have close connections that can be traced to the roo...
The parameterized model-checking problem for a class of first-order sentences (queries) asks to deci...
We study the data complexity of reasoning for several fragments of MTL - an extension of Datalog wit...
Abstract. Higher Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal...
AbstractWe study here the language Datalog(≠), which is the query language obtained from Datalog by ...
AbstractIn this paper we study a generalization of datalog, the language of function-free definite c...
We introduce a new approach to implicit complexity in linear logic, inspired by functional database ...
This book presents the main results of descriptive complexity theory, that is, the connections betwe...
The study of inconsistency-tolerant semantics for query answering in ontological languages has recen...
AbstractWe present here a depth-bounded bottom-up evaluation algorithm for logic programs. We show t...