| Publication | Date of Publication | Type |
|---|
On the power of automata minimization in reactive synthesis
| 2024-12-06 | Paper |
Logical algorithmics: from theory to practice (invited talk)
| 2024-10-08 | Paper |
Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata
Theoretical Computer Science | 2024-06-26 | Paper |
An automata-theoretic approach to linear temporal logic
| 2024-06-21 | Paper |
Finite-trace and generalized-reactivity specifications in temporal synthesis
Formal Methods in System Design | 2024-03-11 | Paper |
Satisfiability checking for mission-time LTL
Computer Aided Verification | 2024-02-16 | Paper |
Safety and co-safety comparator automata for discounted-sum inclusion
Computer Aided Verification | 2024-02-16 | Paper |
ZDD Boolean synthesis
| 2024-01-23 | Paper |
Towards a grand unification of Büchi complementation constructions
Lecture Notes in Computer Science | 2023-08-10 | Paper |
A space-efficient on-the-fly algorithm for real-time model checking
CONCUR '96: Concurrency Theory | 2023-06-28 | Paper |
From linear temporal logics to Büchi automata: the early and simple principle
Model Checking, Synthesis, and Learning | 2023-05-26 | Paper |
On the power of finite ambiguity in Büchi complementation
Information and Computation | 2023-05-19 | Paper |
On the complexity of verifying concurrent transition systems
CONCUR '97: Concurrency Theory | 2023-05-17 | Paper |
Functional synthesis via input-output separation
Formal Methods in System Design | 2023-05-08 | Paper |
Automata vs linear-programming discounted-sum inclusion
Computer Aided Verification | 2023-05-05 | Paper |
Congruence Relations for Büchi Automata
| 2023-04-21 | Paper |
Solving Quantum-Inspired Perfect Matching Problems via Tutte's Theorem-Based Hybrid Boolean Constraints
| 2023-01-24 | Paper |
Satisfiability checking for mission-time \textsf{LTL} (MLTL)
Information and Computation | 2022-12-08 | Paper |
Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition
| 2022-12-07 | Paper |
Quantum-Inspired Perfect Matching under Vertex-Color Constraints
| 2022-09-26 | Paper |
A nonstandard approach to the logical omniscience problem
Artificial Intelligence | 2022-09-21 | Paper |
scientific article; zbMATH DE number 7577577 (Why is no real title available?)
| 2022-08-30 | Paper |
Sequential relational decomposition
Logical Methods in Computer Science | 2022-08-02 | Paper |
Linear temporal logic -- from infinite to finite horizon
| 2022-06-22 | Paper |
Adapting behaviors via reactive synthesis
| 2022-03-25 | Paper |
ProCount: weighted projected model counting with graded project-join trees
| 2022-03-22 | Paper |
On the Unreasonable Effectiveness of SAT Solvers
| 2022-02-04 | Paper |
scientific article; zbMATH DE number 7455737 (Why is no real title available?)
| 2022-01-11 | Paper |
scientific article; zbMATH DE number 7455747 (Why is no real title available?)
| 2022-01-11 | Paper |
scientific article; zbMATH DE number 7455748 (Why is no real title available?)
| 2022-01-11 | Paper |
Verification
| 2021-11-12 | Paper |
Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
Artificial Intelligence | 2021-11-02 | Paper |
SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking
Artificial Intelligence | 2021-08-16 | Paper |
On satisficing in quantitative games
| 2021-08-04 | Paper |
scientific article; zbMATH DE number 7378545 (Why is no real title available?)
| 2021-08-04 | Paper |
Profile trees for Büchi word automata, with application to determinization
| 2021-06-09 | Paper |
Synthesis from recursive-components libraries
| 2021-03-03 | Paper |
Sequential relational decomposition
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
scientific article; zbMATH DE number 7297854 (Why is no real title available?)
| 2021-01-19 | Paper |
scientific article; zbMATH DE number 7297884 (Why is no real title available?)
| 2021-01-19 | Paper |
Knowledge-based programs
Distributed Computing | 2020-12-02 | Paper |
On hashing-based approaches to approximate DNF-counting
| 2020-11-25 | Paper |
Flow games
| 2020-11-25 | Paper |
Infinitary logic for computer science
Automata, Languages and Programming | 2019-12-04 | Paper |
Not all FPRASs are equal: demystifying FPRASs for DNF-counting
Constraints | 2019-11-27 | Paper |
SAT-based explicit LTL reasoning and its application to satisfiability checking
Formal Methods in System Design | 2019-11-18 | Paper |
First-order vs. second-order encodings for \textsc{ltl}\(_f\)-to-automata translation
| 2019-10-15 | Paper |
Alternating automata: unifying truth and validity checking for temporal logics
Automated Deduction—CADE-14 | 2019-10-01 | Paper |
In memoriam Paris C. Kanellakis
ACM Computing Surveys | 2019-08-09 | Paper |
Random models for evaluating efficient Büchi universality checking
Logic and Its Applications | 2019-07-24 | Paper |
BDD-based Boolean functional synthesis
Computer Aided Verification | 2019-05-03 | Paper |
Accelerating LTL satisfiability checking by SAT solvers
Journal Of Logic And Computation | 2019-01-31 | Paper |
Solving parity games: explicit vs symbolic
| 2018-11-07 | Paper |
Comparator automata in quantitative verification
| 2018-07-17 | Paper |
Mode-Target Games: Reactive Synthesis for Control Applications
IEEE Transactions on Automatic Control | 2018-06-27 | Paper |
An explicit transition system construction approach to LTL satisfiability checking
Formal Aspects of Computing | 2018-03-29 | Paper |
Supervisory control and reactive synthesis: a comparative introduction
Discrete Event Dynamic Systems | 2018-01-31 | Paper |
Knowledge-based programs
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 | 2017-09-29 | Paper |
Regular queries on graph databases
Theory of Computing Systems | 2017-09-20 | Paper |
\(\mathrm{LTL}_{f}\) satisfiability checking
| 2017-07-18 | Paper |
From linear time to branching time
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Regular Real Analysis
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Solving partial-information stochastic parity games
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Regular queries on graph databases
| 2017-06-13 | Paper |
Iterative temporal motion planning for hybrid systems in partially unknown environments
Proceedings of the 16th international conference on Hybrid systems: computation and control | 2017-05-16 | Paper |
Reasoning about strategies: on the satisfiability problem
| 2017-05-08 | Paper |
Relentful strategic reasoning in alternating-time temporal logic
Journal Of Logic And Computation | 2017-01-31 | Paper |
Solving parity games using an automata-based algorithm
Implementation and Application of Automata | 2016-11-09 | Paper |
Synthesis with rational environments
Annals of Mathematics and Artificial Intelligence | 2016-09-16 | Paper |
Semantic acyclicity on graph databases
SIAM Journal on Computing | 2016-08-16 | Paper |
On computing minimal independent support and its applications to sampling and counting
Constraints | 2016-04-12 | Paper |
Profile trees for Büchi word automata, with application to determinization
Information and Computation | 2015-12-07 | Paper |
The Complexity of Synthesis from Probabilistic Components
Automata, Languages, and Programming | 2015-11-04 | Paper |
Reasoning about strategies: on the model-checking problem
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Monotone monadic SNP and constraint satisfaction
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Parametric real-time reasoning
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
From Löwenheim to PSL and SVA
Lecture Notes in Computer Science | 2015-02-10 | Paper |
State of Büchi complementation
Logical Methods in Computer Science | 2015-01-15 | Paper |
Proving that programs eventually do something good
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-09-12 | Paper |
Synthesis from probabilistic components
Logical Methods in Computer Science | 2014-07-31 | Paper |
The complexity of partial-observation stochastic parity games with finite-memory strategies
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Optimized temporal monitors for SystemcC
Formal Methods in System Design | 2014-03-28 | Paper |
Temporal property verification as a program analysis task
Formal Methods in System Design | 2014-03-28 | Paper |
On simplification of schema mappings
Journal of Computer and System Sciences | 2014-01-20 | Paper |
SAT-based induction for temporal safety properties
| 2013-09-20 | Paper |
Verification of Open Systems
Interactive Computation | 2013-06-18 | Paper |
Pushdown module checking with imperfect information
Information and Computation | 2013-06-06 | Paper |
Unifying Büchi complementation constructions
Logical Methods in Computer Science | 2013-04-09 | Paper |
What makes \textsc{Atl}* decidable? A decidable fragment of strategy logic
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Synthesis from probabilistic components
| 2012-09-18 | Paper |
Unifying Büchi complementation constructions
| 2012-09-18 | Paper |
Reasoning about strategies
| 2012-08-29 | Paper |
\textit{Once} and \textit{for all}
Journal of Computer and System Sciences | 2012-08-17 | Paper |
Synthesizing Probabilistic Composers
Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
Büchi complementation and size-change termination
Logical Methods in Computer Science | 2012-04-03 | Paper |
Temporal synthesis for bounded systems and environments
| 2012-01-23 | Paper |
Dynamic Reactive Modules
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
On bounded specifications
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-05-06 | Paper |
The complexity of integer bound propagation
Journal of Artificial Intelligence Research | 2011-05-04 | Paper |
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
| 2011-04-08 | Paper |
scientific article; zbMATH DE number 5872401 (Why is no real title available?)
| 2011-03-30 | Paper |
State of Büchi complementation
Implementation and Application of Automata | 2011-02-11 | Paper |
Synthesis of Trigger Properties
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-01-07 | Paper |
Relentful strategic reasoning in alternating-time temporal logic
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-01-07 | Paper |
An automata-theoretic approach to infinite-state systems
Time for Verification | 2010-09-07 | Paper |
Efficient Büchi universality checking
Tools and Algorithms for the Construction and Analysis of Systems | 2010-04-27 | Paper |
Enhanced vacuity detection in linear temporal logic.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Optimizing a BDD-based modal solver.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Fair equivalence relations
Lecture Notes in Computer Science | 2010-03-23 | Paper |
Correct Hardware Design and Verification Methods
Lecture Notes in Computer Science | 2010-02-05 | Paper |
On complementing nondeterministic Büchi automata
Lecture Notes in Computer Science | 2010-02-05 | Paper |
BDD-based decision procedures for the modal logic K ★
Journal of Applied Non-Classical Logics | 2009-11-30 | Paper |
From liveness to promptness
Formal Methods in System Design | 2009-11-23 | Paper |
Hybrid systems: From verification to falsification by combining motion planning and discrete search
Formal Methods in System Design | 2009-11-23 | Paper |
Multi-Objective Model Checking of Markov Decision Processes
Logical Methods in Computer Science | 2009-04-29 | Paper |
The planning spectrum - one, two, three, infinity
| 2009-04-28 | Paper |
Synthesis from Component Libraries
Foundations of Software Science and Computational Structures | 2009-03-31 | Paper |
Büchi Complementation and Size-Change Termination
Tools and Algorithms for the Construction and Analysis of Systems | 2009-03-31 | Paper |
Falsification of LTL Safety Properties in Hybrid Systems
Tools and Algorithms for the Construction and Analysis of Systems | 2009-03-31 | Paper |
From Philosophical to Industrial Logics
Logic and Its Applications | 2009-02-12 | Paper |
scientific article; zbMATH DE number 5504157 (Why is no real title available?)
| 2009-02-09 | Paper |
A Logical Approach to Constraint Satisfaction
Complexity of Constraints | 2009-01-22 | Paper |
Weak alternating automata are not that weak
ACM Transactions on Computational Logic | 2008-12-21 | Paper |
On the expressive power of Datalog: tools and a case study.
Journal of Computer and System Sciences | 2008-12-21 | Paper |
The Complexity of Enriched Mu-Calculi
Logical Methods in Computer Science | 2008-11-13 | Paper |
Pushdown Module Checking with Imperfect Information
CONCUR 2007 – Concurrency Theory | 2008-09-18 | Paper |
Principles and Practice of Constraint Programming – CP 2004
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Principles and Practice of Constraint Programming – CP 2004
Lecture Notes in Computer Science | 2008-09-09 | Paper |
An Analysis of Slow Convergence in Interval Propagation
Principles and Practice of Constraint Programming – CP 2007 | 2008-09-02 | Paper |
Open Implication
Automata, Languages and Programming | 2008-08-19 | Paper |
From Church and Prior to PSL
25 Years of Model Checking | 2008-07-15 | Paper |
Branching vs. Linear Time: Semantical Perspective
Automated Technology for Verification and Analysis | 2008-07-03 | Paper |
Linear-Time Model Checking: Automata Theory in Practice
Implementation and Application of Automata | 2008-06-10 | Paper |
Experimental Evaluation of Classical Automata Constructions
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
Treewidth in Verification: Local vs. Global
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
On Locally Checkable Properties
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
An automata-theoretic approach to branching-time model checking
Journal of the ACM | 2008-05-05 | Paper |
Automata-Theoretic Model Checking Revisited
Lecture Notes in Computer Science | 2008-04-04 | Paper |
From Monadic Logic to PSL
Pillars of Computer Science | 2008-03-25 | Paper |
Aggregating disparate estimates of chance
Games and Economic Behavior | 2008-01-16 | Paper |
Automata- and logic-based systems design
| 2008-01-14 | Paper |
A continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas
Random Structures & Algorithms | 2008-01-08 | Paper |
From Liveness to Promptness
Computer Aided Verification | 2007-11-29 | Paper |
Hybrid Systems: From Verification to Falsification
Computer Aided Verification | 2007-11-29 | Paper |
GSTE is partitioned model checking
Formal Methods in System Design | 2007-10-11 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-09-28 | Paper |
The Complexity of Enriched μ-Calculi
Automata, Languages and Programming | 2007-09-11 | Paper |
Safraless Compositional Synthesis
Computer Aided Verification | 2007-09-05 | Paper |
Property-Driven Partitioning for Abstraction Refinement
Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-03 | Paper |
Multi-objective Model Checking of Markov Decision Processes
Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-03 | Paper |
The Büchi Complementation Saga
STACS 2007 | 2007-09-03 | Paper |
View-based query processing: on the relationship between rewriting, answering and losslessness
Theoretical Computer Science | 2007-03-12 | Paper |
Symbolic techniques in satisfiability solving
Journal of Automated Reasoning | 2007-01-24 | Paper |
Coverage metrics for temporal logic model checking
Formal Methods in System Design | 2006-11-17 | Paper |
Automated Technology for Verification and Analysis
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Correct Hardware Design and Verification Methods
Lecture Notes in Computer Science | 2006-10-20 | Paper |
First-order logic with two variables and unary temporal logic
Information and Computation | 2006-10-10 | Paper |
BÜCHI COMPLEMENTATION MADE TIGHTER
International Journal of Foundations of Computer Science | 2006-08-21 | Paper |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2006-07-07 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Relating word and tree automata
Annals of Pure and Applied Logic | 2005-12-29 | Paper |
scientific article; zbMATH DE number 2241908 (Why is no real title available?)
| 2005-12-28 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-16 | Paper |
From complementation to certification
Theoretical Computer Science | 2005-12-06 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2005-11-10 | Paper |
scientific article; zbMATH DE number 2209335 (Why is no real title available?)
| 2005-09-28 | Paper |
Database Theory - ICDT 2005
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Database Theory - ICDT 2005
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Decidable containment of recursive queries
Theoretical Computer Science | 2005-06-10 | Paper |
scientific article; zbMATH DE number 2149446 (Why is no real title available?)
| 2005-03-30 | Paper |
Complete Axiomatizations for Reasoning about Knowledge and Time
SIAM Journal on Computing | 2005-02-21 | Paper |
Finite model theory and its applications.
Texts in Theoretical Computer Science. An EATCS Series | 2005-01-12 | Paper |
scientific article; zbMATH DE number 2102704 (Why is no real title available?)
| 2004-09-24 | Paper |
scientific article; zbMATH DE number 2102710 (Why is no real title available?)
| 2004-09-24 | Paper |
scientific article; zbMATH DE number 2090285 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 2090317 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 2084701 (Why is no real title available?)
| 2004-08-09 | Paper |
scientific article; zbMATH DE number 2080199 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2080056 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2080304 (Why is no real title available?)
| 2004-08-04 | Paper |
Random 3-SAT: The plot thickens
Constraints | 2004-03-15 | Paper |
scientific article; zbMATH DE number 2038748 (Why is no real title available?)
| 2004-02-08 | Paper |
scientific article; zbMATH DE number 2038699 (Why is no real title available?)
| 2004-02-08 | Paper |
scientific article; zbMATH DE number 1916673 (Why is no real title available?)
| 2003-12-16 | Paper |
scientific article; zbMATH DE number 1980931 (Why is no real title available?)
| 2003-09-15 | Paper |
From bidirectionality to alternation.
Theoretical Computer Science | 2003-08-17 | Paper |
scientific article; zbMATH DE number 1956573 (Why is no real title available?)
| 2003-07-30 | Paper |
scientific article; zbMATH DE number 1956580 (Why is no real title available?)
| 2003-07-30 | Paper |
scientific article; zbMATH DE number 1953141 (Why is no real title available?)
| 2003-07-25 | Paper |
scientific article; zbMATH DE number 1931697 (Why is no real title available?)
| 2003-06-20 | Paper |
scientific article; zbMATH DE number 1903366 (Why is no real title available?)
| 2003-05-01 | Paper |
scientific article; zbMATH DE number 1775458 (Why is no real title available?)
| 2003-02-19 | Paper |
A nonstandard approach to the logical omniscience problem
Artificial Intelligence | 2003-02-04 | Paper |
scientific article; zbMATH DE number 1863182 (Why is no real title available?)
| 2003-02-03 | Paper |
On the complexity of verifying concurrent transition systems
Information and Computation | 2003-01-14 | Paper |
Module checking
Information and Computation | 2003-01-14 | Paper |
scientific article; zbMATH DE number 1759605 (Why is no real title available?)
| 2002-11-28 | Paper |
scientific article; zbMATH DE number 1834680 (Why is no real title available?)
| 2002-11-25 | Paper |
scientific article; zbMATH DE number 1759397 (Why is no real title available?)
| 2002-11-04 | Paper |
scientific article; zbMATH DE number 1759436 (Why is no real title available?)
| 2002-11-04 | Paper |
Bisimulation minimization and symbolic model checking
Formal Methods in System Design | 2002-09-18 | Paper |
Rewriting of regular expressions and regular path queries
Journal of Computer and System Sciences | 2002-09-12 | Paper |
scientific article; zbMATH DE number 1796124 (Why is no real title available?)
| 2002-09-04 | Paper |
scientific article; zbMATH DE number 1765663 (Why is no real title available?)
| 2002-07-10 | Paper |
Verification by augmented abstraction: The automata-theoretic view
Journal of Computer and System Sciences | 2002-04-28 | Paper |
Model checking of safety properties
Formal Methods in System Design | 2002-04-04 | Paper |
scientific article; zbMATH DE number 1705164 (Why is no real title available?)
| 2002-02-14 | Paper |
scientific article; zbMATH DE number 1705167 (Why is no real title available?)
| 2002-02-14 | Paper |
scientific article; zbMATH DE number 1701778 (Why is no real title available?)
| 2002-02-05 | Paper |
scientific article; zbMATH DE number 1701356 (Why is no real title available?)
| 2002-02-05 | Paper |
scientific article; zbMATH DE number 1670767 (Why is no real title available?)
| 2001-11-11 | Paper |
scientific article; zbMATH DE number 1670790 (Why is no real title available?)
| 2001-11-11 | Paper |
Towards an efficient library for SAT: A manifesto
| 2001-09-24 | Paper |
On the unusual effectiveness of logic in computer science
The Bulletin of Symbolic Logic | 2001-09-10 | Paper |
A new heuristic for bad cycle detection using BDDs
Formal Methods in System Design | 2001-09-09 | Paper |
scientific article; zbMATH DE number 1487861 (Why is no real title available?)
| 2001-05-28 | Paper |
scientific article; zbMATH DE number 1555173 (Why is no real title available?)
| 2001-01-22 | Paper |
Conjunctive-query containment and constraint satisfaction
Journal of Computer and System Sciences | 2000-12-19 | Paper |
scientific article; zbMATH DE number 1479635 (Why is no real title available?)
| 2000-07-20 | Paper |
scientific article; zbMATH DE number 1444727 (Why is no real title available?)
| 2000-05-09 | Paper |
scientific article; zbMATH DE number 1418458 (Why is no real title available?)
| 2000-03-19 | Paper |
scientific article; zbMATH DE number 1392310 (Why is no real title available?)
| 2000-01-25 | Paper |
scientific article; zbMATH DE number 1392300 (Why is no real title available?)
| 2000-01-25 | Paper |
scientific article; zbMATH DE number 1304989 (Why is no real title available?)
| 2000-01-12 | Paper |
scientific article; zbMATH DE number 1361134 (Why is no real title available?)
| 1999-12-20 | Paper |
scientific article; zbMATH DE number 1304332 (Why is no real title available?)
| 1999-11-16 | Paper |
scientific article; zbMATH DE number 1351076 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 1999-10-20 | Paper |
Church's Problem Revisited
The Bulletin of Symbolic Logic | 1999-09-22 | Paper |
scientific article; zbMATH DE number 1332664 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 1999-09-08 | Paper |
scientific article; zbMATH DE number 1332671 (Why is no real title available?)
| 1999-09-08 | Paper |
scientific article; zbMATH DE number 1324661 (Why is no real title available?)
| 1999-08-17 | Paper |
Common knowledge revisited
Annals of Pure and Applied Logic | 1999-06-24 | Paper |
Computational model theory: an overview
Logic Journal of the IGPL | 1999-04-08 | Paper |
scientific article; zbMATH DE number 1223729 (Why is no real title available?)
| 1999-03-25 | Paper |
The hierarchical approach to modeling knowledge and common knowledge
International Journal of Game Theory | 1999-01-01 | Paper |
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
SIAM Journal on Computing | 1998-09-21 | Paper |
Fixpoint logics, relational machines, and computational complexity
Journal of the ACM | 1998-01-22 | Paper |
scientific article; zbMATH DE number 1059246 (Why is no real title available?)
| 1997-09-10 | Paper |
On the Decision Problem for Two-Variable First-Order Logic
The Bulletin of Symbolic Logic | 1997-06-30 | Paper |
Undecidable boundedness problems for datalog programs
The Journal of Logic Programming | 1997-04-17 | Paper |
On the equivalence of recursive and nonrecursive Datalog programs
Journal of Computer and System Sciences | 1997-03-18 | Paper |
Computing with infinitary logic
Theoretical Computer Science | 1997-02-28 | Paper |
IN MEMORIAM Paris C. Kanellakis (1953–1995)
Journal of Algorithms | 1996-06-04 | Paper |
Reasoning about infinite computations
Information and Computation | 1995-12-13 | Paper |
On monadic NP vs monadic co-NP
Information and Computation | 1995-09-17 | Paper |
scientific article; zbMATH DE number 795590 (Why is no real title available?)
| 1995-09-11 | Paper |
On the complexity of queries in the logical data model
Theoretical Computer Science | 1994-11-06 | Paper |
What can machines know?
Journal of the ACM | 1994-08-21 | Paper |
A model-theoretic analysis of knowledge
Journal of the ACM | 1994-08-21 | Paper |
Undecidable optimization problems for database logic programs
Journal of the ACM | 1993-12-06 | Paper |
Logical query optimization by proof-tree transformation
Journal of Computer and System Sciences | 1993-10-10 | Paper |
scientific article; zbMATH DE number 177248 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 177519 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 176242 (Why is no real title available?)
| 1993-05-18 | Paper |
What is an inference rule?
Journal of Symbolic Logic | 1993-04-01 | Paper |
scientific article; zbMATH DE number 140397 (Why is no real title available?)
| 1993-03-28 | Paper |
scientific article; zbMATH DE number 88991 (Why is no real title available?)
| 1993-01-16 | Paper |
scientific article; zbMATH DE number 65748 (Why is no real title available?)
| 1992-09-27 | Paper |
Infinitary logics and 0-1 laws
Information and Computation | 1992-09-27 | Paper |
Verification of concurrent programs: The automata-theoretic framework
Annals of Pure and Applied Logic | 1991-01-01 | Paper |
Polynomial-time implication problems for unary inclusion dependencies
Journal of the ACM | 1990-01-01 | Paper |
0-1 laws and decision problems for fragments of second-order logic
Information and Computation | 1990-01-01 | Paper |
Endmarkers can make a difference
Information Processing Letters | 1990-01-01 | Paper |
A note on the reduction of two-way automata to one-way automata
Information Processing Letters | 1989-01-01 | Paper |
The complexity of reasoning about knowledge and time. I: Lower bounds
Journal of Computer and System Sciences | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4181308 (Why is no real title available?)
| 1989-01-01 | Paper |
scientific article; zbMATH DE number 4064541 (Why is no real title available?)
| 1988-01-01 | Paper |
On the expressive power of data dependencies
Acta Informatica | 1986-01-01 | Paper |
scientific article; zbMATH DE number 4001521 (Why is no real title available?)
| 1986-01-01 | Paper |
Automata-theoretic techniques for modal logics of programs
Journal of Computer and System Sciences | 1986-01-01 | Paper |
Querying logical databases
Journal of Computer and System Sciences | 1986-01-01 | Paper |
The Implication Problem for Functional and Inclusion Dependencies is Undecidable
SIAM Journal on Computing | 1985-01-01 | Paper |
Formal systems for join dependencies
Theoretical Computer Science | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3974280 (Why is no real title available?)
| 1985-01-01 | Paper |
A note on lossless database decompositions
Information Processing Letters | 1984-01-01 | Paper |
On acyclic database decompositions
Information and Control | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3876574 (Why is no real title available?)
| 1984-01-01 | Paper |
A Proof Procedure for Data Dependencies
Journal of the ACM | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3898274 (Why is no real title available?)
| 1984-01-01 | Paper |
On the foundations of the universal relation model
ACM Transactions on Database Systems | 1984-01-01 | Paper |
Formal Systems for Tuple and Equality Generating Dependencies
SIAM Journal on Computing | 1984-01-01 | Paper |
The implication and finite implication problems for typed template dependencies
Journal of Computer and System Sciences | 1984-01-01 | Paper |
Armstrong databases for functional and inclusion dependencies
Information Processing Letters | 1983-01-01 | Paper |
Inferring multivalued dependencies from functional and join dependencies
Acta Informatica | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3723857 (Why is no real title available?)
| 1981-01-01 | Paper |
The decision problem for database dependencies
Information Processing Letters | 1981-01-01 | Paper |
