Generalized Model-Checking Problems for First-Order Logic
- 16 March 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Parameterized ComplexityPublished by Springer Nature ,1999
- Deciding First-Order Properties of Locally Tree-Decomposable GraphsLecture Notes in Computer Science, 1999
- Conjunctive query containment revisitedLecture Notes in Computer Science, 1996
- Efficient Algorithms for Listing Combinatorial StructuresPublished by Cambridge University Press (CUP) ,1993
- Monotone monadic SNP and constraint satisfactionPublished by Association for Computing Machinery (ACM) ,1993
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Knots and links in spatial graphsJournal of Graph Theory, 1983
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- On Local and Non-Local PropertiesPublished by Elsevier ,1982
- Optimal implementation of conjunctive queries in relational data basesPublished by Association for Computing Machinery (ACM) ,1977