Phokion G. Kolaitis

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2001

In Search of a Phase Transition in the AC-Matching Problem.

[BibT_eX]

[DOI]

Thomas Raffill

Proceedings of the Principles and Practice of Constraint Programming, 2001

2000

Foreword: Selected Papers from ICDT 1997.

[BibT_eX]

[DOI]

Foto N. Afrati

Theor. Comput. Sci., 2000

Conjunctive-Query Containment and Constraint Satisfaction.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2000

Unification Algorithms Cannot Be Combined in Polynomial Time.

[BibT_eX]

[DOI]

Inf. Comput., 2000

The Complexity of Minimal Satisfiability Problems

[BibT_eX]

[DOI]

Lefteris M. Kirousis

Electron. Colloquium Comput. Complex., 2000

0-1 Laws for Fragments of Existential Second-Order Logic: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

A Game-Theoretic Approach to Constraint Satisfaction.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999

Computational Complexity of Simultaneous Elementary Matching Problems.

[BibT_eX]

[DOI]

J. Autom. Reason., 1999

On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System.

[BibT_eX]

[DOI]

Laurent Juban

Proceedings of the Logic Programming and Automated Reasoning, 6th International Conference, 1999

First-Order Logic vs. Fixed-Point Logic in Finite Set Theory.

[BibT_eX]

[DOI]

Albert Atserias

Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1998

Integer Programming as a Framework for Optimization and Approximability.

[BibT_eX]

[DOI]

Ian Barland

J. Comput. Syst. Sci., 1998

Panel: logic in the computer science curriculum.

[BibT_eX]

[DOI]

Proceedings of the 29th SIGCSE Technical Symposium on Computer Science Education, 1998

On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates.

[BibT_eX]

[DOI]

David L. Martin

Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1998

On the Boundedness Problem for Two-Variable First-Order Logic.

[BibT_eX]

[DOI]

Martin Otto

Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1997

Can Datalog Be Approximated?

[BibT_eX]

[DOI]

Surajit Chaudhuri

J. Comput. Syst. Sci., 1997

On the decision problem for two-variable first-order logic.

[BibT_eX]

[DOI]

Erich Grädel

Bull. Symb. Log., 1997

How to Define a Linear Order on Finite Models.

[BibT_eX]

[DOI]

Lauri Hella

Kerkko Luosto

Ann. Pure Appl. Log., 1997

On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997

1996

Almost everywhere equivalence of logics in finite model theory.

[BibT_eX]

[DOI]

Lauri Hella

Kerkko Luosto

Bull. Symb. Log., 1996

On the Expressive Power of Variable-Confined Logics.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 1996

1995

The Complexity of Counting Problems in Equational Matching.

[BibT_eX]

[DOI]

J. Symb. Comput., 1995

On the Expressive Power of Datalog: Tools and a Case Study.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

Approximation Properties of NP Minimization Classes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

Generalized Quantifiers and Pebble Games on Finite Structures.

[BibT_eX]

[DOI]

Jouko A. Väänänen

Ann. Pure Appl. Log., 1995

Combinatorial Games In Database Theory.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1995

Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Languages for Polynomial-Time Queries - An Ongoing Quest.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 1995

Implicit Definability and Infinitary Logic in Finite Model Theory.

[BibT_eX]

[DOI]

Anuj Dawar

Lauri Hella

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994

Logical Definability of NP Optimization Problems

[BibT_eX]

[DOI]

Inf. Comput., December, 1994

1993

A Tutorial on Finite Model Theory (Abstract)

[BibT_eX]

Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

Polynomial-time Optimization, Parallel Approximation, and Fixpoint Logic (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

1992

Infinitary Logics and 0-1 Laws

[BibT_eX]

[DOI]

Inf. Comput., June, 1992

Fixpoint Logic vs. Infinitary Logic in Finite-Model Theory

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

Infinitary Logic for Computer Science.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991

The Expressive Power of Stratified Programs

[BibT_eX]

[DOI]

Inf. Comput., January, 1991

Why not Negation by Fixpoint?

[BibT_eX]

[DOI]

Christos H. Papadimitriou

J. Comput. Syst. Sci., 1991

1990

Some Computational Aspects of Circumscription

[BibT_eX]

[DOI]

Christos H. Papadimitriou

J. ACM, January, 1990

0-1 Laws and Decision Problems for Fragments of Second-Order Logic

[BibT_eX]

[DOI]

Inf. Comput., 1990

0-1 Laws for Infinitary Logics (Preliminary Report)

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

Implicit Definability on Finite Structures and Unambiguous Computations (Preliminary Report)

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

1987

The Decision Problem for the Probabilities of Higher-Order Properties

[BibT_eX]

[DOI]

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1985

On Asymptotic Probability of Inductive Queries and Their Decision Problem.

[BibT_eX]

[DOI]

Proceedings of the Logics of Programs, 1985

1979

Recursion in a Quantifier vs. Elementary Induction.

[BibT_eX]

[DOI]