scientific article; zbMATH DE number 965572
From MaRDI portal
Publication:5691140
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Undecidability and degrees of sets of sentences (03D35) Analysis of algorithms and problem complexity (68Q25)
Recommendations
Cited in
(only showing first 100 items - show all)- From Hilbert's program to a logic tool box
- Exploiting functional dependencies in declarative problem specifications
- Decidable fragments of many-sorted logic
- Hybrid logic meets IF modal logic
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Complexity and decidability
- Metafinite model theory
- Integrity constraints for XML
- Undecidability of domino games and hhp-bisimilarity.
- Path constraints in semistructured databases
- Relational transducers for electronic commerce
- Decidable fragments of first-order temporal logics
- Rewriting queries using views over monadic database schemas
- The ^2 fragment of the first-order theory of atomic set constraints is _1⁰-hard
- Logical foundations of information disclosure in ontology-based data integration
- Local rules and global order, or aperiodic tilings
- Axiomatizing the monodic fragment of first-order temporal logic
- Logic with equality: Partisan corroboration and shifted pairing
- Thue trees
- On the complexity of decision using destinies in \(H\)-bounded structures
- Arithmetical definability and computational complexity
- On logics with two variables
- Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus
- Simultaneous rigid E-unification and other decision problems related to the Herbrand theorem
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
- On the relationship between the complexity of decidability and decomposability of first-order theories
- Logical separability of labeled data examples under ontologies
- Algebraic model checking for discrete linear dynamical systems
- Communities and ancestors associated with Egon Börger and ASM
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
- Computation on structures. Behavioural theory, logic, complexity
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation
- Small model property reflects in games and automata
- Semiring programming: a semantic framework for generalized sum product problems
- Stratified guarded first-order transition systems
- The fluted fragment with transitive relations
- First-order rewritability of ontology-mediated queries in linear temporal logic
- The dark side of interval temporal logic: marking the undecidability border
- Axiomatizing the logical core of XPath 2.0
- On coarser interval temporal logics
- Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter
- Succinct definitions in the first order theory of graphs
- Controlled query evaluation with open queries for a decidable relational submodel
- Data-complexity of the two-variable fragment with counting quantifiers
- A survey on temporal logics for specifying and verifying real-time systems
- Decidable cases of first-order temporal logic with functions
- Modal definability of first-order formulas with free variables and query answering
- Automated reformulation of specifications by safe delay of constraints
- Temporal prepositions and their logic
- A SAT-based parser and completer for pictures specified by tiling
- Herbrand's theorem and term induction
- Definability and decidability of binary predicates for time granularity
- The recognizability of sets of graphs is a robust property
- Guarded fragments with constants
- The undecidability of iterated modal relativization
- Symbioses between mathematical logic and computer science
- On the data complexity of consistent query answering
- Computational complexity of theories of a binary predicate with a small number of variables
- Static analysis of navigational XPath over graph databases
- Decision procedures for flat array properties
- A logical approach to data-aware automated sequence generation
- On satisfiability in ATL with strategy contexts
- The Bernays-Schönfinkel-Ramsey class for set theory: decidability
- Inseparability and conservative extensions of description logic ontologies: a survey
- Set-syllogistics meet combinatorics
- Optimal tableau systems for propositional neighborhood logic over all, dense, and discrete linear orders
- Combining theories: the Ackerman and guarded fragments
- Combining Model Checking and Deduction
- Extended First-Order Logic
- Undecidability of the logic of overlap relation over discrete linear orderings
- Ein Direkter Beweis für die Allgemein‐Rekursive Unlösbarkeit des Entscheidungsproblems des Prädikatenkalküls der Ersten Stufe mit Identität
- Bounded quantifier instantiation for checking inductive invariants
- Second-order quantifier elimination on relational monadic formulas -- a basic method and some less expected applications
- Decidable Fragments of Many-Sorted Logic
- Monadic Fragments of Gödel Logics: Decidability and Undecidability Results
- How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited
- Expressive Power and Decidability for Memory Logics
- On the Almighty Wand
- The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey
- Decidability and Undecidability in Probability Logic
- Extracting Modules from Ontologies: A Logic-Based Approach
- Relational Properties Expressible with One Universal Quantifier Are Testable
- Combinations of Theories for Decidable Fragments of First-Order Logic
- Combining theories with shared set operations
- Thinking Ahead: The Decision Problem
- scientific article; zbMATH DE number 3715502 (Why is no real title available?)
- scientific article; zbMATH DE number 8775 (Why is no real title available?)
- On the almighty wand
- Verification of multi-linked heaps
- Testable and untestable classes of first-order formulae
- Separation logics and modalities: a survey
- Decidability of the Clark's completion semantics for monadic programs and queries
- Quantifying over events in probability logic: an introduction
- Spatial reasoning with \(\mathcal{RCC} 8\) and connectedness constraints in Euclidean spaces
- A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions
- The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
- The expressiveness of quasiperiodic and minimal shifts of finite type
- On the complexity of team logic and its two-variable fragment
- Probabilistic Modeling of Default Reasoning
- Trakhtenbrot’s Theorem in Coq
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5691140)
