On the public citation graph
On the Decision Problem for Two-Variable First-Order Logic
0 signed · 334 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/malq.19750210118openalex-snapshot
On languages with two variables
inferredcites →https://doi.org/10.1006/inco.1995.1084openalex-snapshot
Infinitary Logic and Inductive Definability over Finite Structures
inferredcites →https://doi.org/10.1006/jcss.1995.1055openalex-snapshot
On the Expressive Power of Datalog: Tools and a Case Study
inferredcites →https://doi.org/10.1007/3-540-08353-7_158openalex-snapshot
On the logic of incomplete information
inferredcites →https://doi.org/10.1007/3-540-13331-3_48openalex-snapshot
The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems)
inferredcites →https://doi.org/10.1007/3-540-51498-8_21openalex-snapshot
Complexity of formula classes in first order logic with functions
inferredcites →https://doi.org/10.1007/978-3-642-59207-2openalex-snapshot
The Classical Decision Problem
inferredcites →https://doi.org/10.1007/978-94-009-8384-7openalex-snapshot
Aspects of Philosophical Logic
inferredcites →https://doi.org/10.1007/bf01305232openalex-snapshot
An optimal lower bound on the number of variables for graph identification
inferredcites →https://doi.org/10.1007/bf01449155openalex-snapshot
Untersuchungen zum Entscheidungsproblem der mathematischen Logik
inferredcites →https://doi.org/10.1007/bf01452848openalex-snapshot
Über die Erfüllbarkeit derjenigen Zählausdrücke, welche in der Normalform zwei benachbarte Allzeichen enthalten
inferredcites →https://doi.org/10.1007/bf01459101openalex-snapshot
Zum Entscheidungsproblem der mathematischen Logik
inferredcites →https://doi.org/10.1007/bf01651329openalex-snapshot
Satisfiability of formulae with one ∀ is decidable in exponential time
inferredcites →https://doi.org/10.1007/bf01708881openalex-snapshot
Zum Entscheidungsproblem des logischen Funktionenkalküls
inferredcites →https://doi.org/10.1007/bfb0023464openalex-snapshot
Undecidability results on two-variable logics
inferredcites →https://doi.org/10.1016/0004-3702(92)90049-4openalex-snapshot
A guide to completeness and complexity for modal logics of knowledge and belief
inferredcites →https://doi.org/10.1016/0022-0000(79)90046-1openalex-snapshot
Propositional dynamic logic of regular programs
inferredcites →https://doi.org/10.1016/0022-0000(80)90027-6openalex-snapshot
Complexity results for classes of quantificational formulas
inferredcites →https://doi.org/10.1016/0022-0000(80)90061-6openalex-snapshot
A near-optimal method for reasoning about action
inferredcites →https://doi.org/10.1016/0022-0000(82)90011-3openalex-snapshot
Upper and lower bounds for first order expressibility
inferredcites →https://doi.org/10.1016/0022-0000(86)90026-7openalex-snapshot
Automata-theoretic techniques for modal logics of programs
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/0890-5401(89)90055-2openalex-snapshot
Definability with bounded number of bound variables
inferredcites →https://doi.org/10.1016/0890-5401(90)90065-popenalex-snapshot
0–1 Laws and decision problems for fragments of second-order logic
inferredcites →https://doi.org/10.1016/0890-5401(92)90021-7openalex-snapshot
Infinitary logics and 0–1 laws
inferredcites →https://doi.org/10.1016/b978-0-934613-03-3.50033-7openalex-snapshot
Some Philosophical Problems from the Standpoint of Artificial Intelligence
inferredcites →https://doi.org/10.1016/b978-1-4832-1453-5.50019-2openalex-snapshot
Knowledge as a Tool in Motion Planning under Uncertainty
inferredcites →https://doi.org/10.1090/dimacs/031openalex-snapshot
Descriptive Complexity and Finite Models
inferredcites →https://doi.org/10.1109/lics.1997.614957openalex-snapshot
Two-variable logic with counting is decidable
inferredcites →https://doi.org/10.1109/tc.1982.1675978openalex-snapshot
Hardware Specification with Temporal Logic: An Example
inferredcites →https://doi.org/10.1112/plms/s2-42.1.230openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem
inferredcites →https://doi.org/10.1137/0206033openalex-snapshot
The Computational Complexity of Provability in Systems of Modal Propositional Logic
inferredcites →https://doi.org/10.1145/298514.298542openalex-snapshot
On the expressive power of datalog
inferredcites →https://doi.org/10.1145/3828.3837openalex-snapshot
The complexity of propositional linear temporal logics
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
inferredcites →https://doi.org/10.1145/79147.79161openalex-snapshot
Knowledge and common knowledge in a distributed environment
inferredcites →https://doi.org/10.2307/2269030openalex-snapshot
Correction to A note on the Entscheidungsproblem
inferredcites →https://doi.org/10.2307/2274274openalex-snapshot
The unsolvability of the Gödel class with identity
inferredcites →https://doi.org/10.2307/2274406openalex-snapshot
Johan van Benthem. Modal logic and classical logic. Indices, no. 3. Bibliopolis, Naples 1985 (©1983), also distributed by Humanities Press, Atlantic Highlands, N.J., 234 pp.
inferredcites →https://doi.org/10.2307/3612165openalex-snapshot
Machine Intelligence 4. Edited by B. Meltzer and D. Michie. Pp. viii, 508. 100s. 1969. (Edinburgh University Press.)
inferredcites →https://doi.org/10.48456/tr-138openalex-snapshot
Authentication: a practical study in belief and action
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118882139.ch14openalex-snapshot
Semantic Complexity in Natural Language
inferred← citeshttps://doi.org/10.1002/malq.19990450304openalex-snapshot
On Preservation Theorems for Two‐Variable Logic
inferred← citeshttps://doi.org/10.1002/malq.201400102openalex-snapshot
The two‐variable fragment with counting and equivalence
inferred← citeshttps://doi.org/10.1002/malq.201700055openalex-snapshot
Finite satisfiability for two‐variable, first‐order logic with one transitive relation is decidable
inferred← citeshttps://doi.org/10.1006/inco.2001.2953openalex-snapshot
First-Order Logic with Two Variables and Unary Temporal Logic
inferred← citeshttps://doi.org/10.1006/jcss.2000.1710openalex-snapshot
Path Constraints in Semistructured Databases
inferred← citeshttps://doi.org/10.1006/jsco.1999.0362openalex-snapshot
Goals and Benchmarks for Automated Map Reasoning
inferred← citeshttps://doi.org/10.1007/11538363_22openalex-snapshot
Results on the Guarded Fragment with Equivalence or Transitive Relations
inferred← citeshttps://doi.org/10.1007/11690634_7openalex-snapshot
A Logic of Reachable Patterns in Linked Data-Structures
inferred← citeshttps://doi.org/10.1007/11965893_12openalex-snapshot
The Limits of Querying Ontologies
inferred← citeshttps://doi.org/10.1007/3-540-28788-4_12openalex-snapshot
Quantifiers and Logical Reductions
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_19openalex-snapshot
The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_6openalex-snapshot
0–1 Laws for Fragments of Existential Second-Order Logic: A Survey
inferred← citeshttps://doi.org/10.1007/3-540-44802-0_18openalex-snapshot
Modal Logic and the Two-Variable Fragment
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_34openalex-snapshot
The Complexity of the Graded μ-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_16openalex-snapshot
A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_50openalex-snapshot
EXPSPACE-Complete Variant of Guarded Fragment with Transitivity
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_17openalex-snapshot
Beth Definability for the Guarded Fragment
inferred← citeshttps://doi.org/10.1007/3-540-48317-9_2openalex-snapshot
Logic-Based Knowledge Representation
inferred← citeshttps://doi.org/10.1007/3-540-49545-2_19openalex-snapshot
Relative Similarity Logics are Decidable: Reduction to FO2 with Equality
inferred← citeshttps://doi.org/10.1007/978-3-030-11680-4_2openalex-snapshot
Which Is the Tallest Building in Europe? Representing and Reasoning About Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-030-22102-7_11openalex-snapshot
Situation Calculus Meets Description Logics
inferred← citeshttps://doi.org/10.1007/978-3-030-40608-0_14openalex-snapshot
Pebble-Intervals Automata and FO$$^2$$ with Two Orders
inferred← citeshttps://doi.org/10.1007/978-3-030-45231-5_6openalex-snapshot
Parameterized Synthesis for Fragments of First-Order Logic Over Data Words
inferred← citeshttps://doi.org/10.1007/978-3-030-51074-9_20openalex-snapshot
SGGS Decision Procedures
inferred← citeshttps://doi.org/10.1007/978-3-030-62419-4_27openalex-snapshot
SHACL Satisfiability and Containment
inferred← citeshttps://doi.org/10.1007/978-3-030-97454-1_2openalex-snapshot
Automatic Conjecturing of P-Recursions Using Lifted Inference
inferred← citeshttps://doi.org/10.1007/978-3-030-99253-8_21openalex-snapshot
Uniform Guarded Fragments
inferred← citeshttps://doi.org/10.1007/978-3-031-91361-7_17openalex-snapshot
Modal Products and Around
inferred← citeshttps://doi.org/10.1007/978-3-319-15545-6_5openalex-snapshot
Modal Satisfiability via SMT Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-66917-5_23openalex-snapshot
SPARQL Query Containment with ShEx Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-98797-2_12openalex-snapshot
Quantitative Logic Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-24615-2_3openalex-snapshot
Mechanised Reasoning and Model Generation for Extended Modal Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_15openalex-snapshot
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_14openalex-snapshot
Description Logics as Ontology Languages for the Semantic Web
inferred← citeshttps://doi.org/10.1007/978-3-540-45091-7_7openalex-snapshot
Description Logics for Ontologies
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_7openalex-snapshot
On Decidability and Expressiveness of Propositional Interval Neighborhood Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-74615-7_2openalex-snapshot
Reasoning in Description Logics: Basics, Extensions, and Relatives
inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_24openalex-snapshot
On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards
inferred← citeshttps://doi.org/10.1007/978-3-540-76298-0_32openalex-snapshot
Using Tableau to Decide Expressive Description Logics with Role Negation
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_22openalex-snapshot
Decidability of the Guarded Fragment with the Transitive Closure
inferred← citeshttps://doi.org/10.1007/978-3-642-04222-5_16openalex-snapshot
Combinations of Theories for Decidable Fragments of First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-04222-5_17openalex-snapshot
Products of Modal Logics with Diagonal Constant Lacking the Finite Model Property
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_27openalex-snapshot
Logics for Two Fragments beyond the Syllogistic Boundary
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_45openalex-snapshot
Two Variables and Two Successors
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_38openalex-snapshot
Two-Variable Logic with Two Order Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-15543-7_1openalex-snapshot
Reasoning and Explanation in $\mathcal{EL}$ and in Expressive Description Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_18openalex-snapshot
On the Satisfiability of Two-Variable Logic over Data Words
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_32openalex-snapshot
On the Complexity of Model Expansion
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_10openalex-snapshot
Complexity of Two-Variable Logic on Finite Trees
inferred← citeshttps://doi.org/10.1007/978-3-662-07003-1_14openalex-snapshot
Other Applications of Finite Model Theory
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_22openalex-snapshot
Monodic Fragments of Probabilistic First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_31openalex-snapshot
Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality
inferred← citeshttps://doi.org/10.1007/978-3-662-58771-3_10openalex-snapshot
Transitivity and Equivalence in Decidable Fragments of First-Order Logic: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-662-58771-3_11openalex-snapshot
The Undecidability of FO3 and the Calculus of Relations with Just One Binary Relation
inferred← citeshttps://doi.org/10.1007/978-3-7908-1769-0_3openalex-snapshot
Representation Theorems and the Semantics of Non-classical Logics, and Applications to Automated Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-7908-1828-4_13openalex-snapshot
Proof Systems in Relation Algebra
inferred← citeshttps://doi.org/10.1007/978-94-017-8860-1_5openalex-snapshot
On the Blok-Esakia Theorem
inferred← citeshttps://doi.org/10.1007/978-981-16-2944-0_4openalex-snapshot
R-Calculi for Description Logics
inferred← citeshttps://doi.org/10.1007/bfb0023464openalex-snapshot
Undecidability results on two-variable logics
inferred← citeshttps://doi.org/10.1007/bfb0055090openalex-snapshot
Reasoning about the past with two-way automata
inferred← citeshttps://doi.org/10.1007/s00012-004-1856-2openalex-snapshot
Varieties of two-dimensional cylindric algebras II
inferred← citeshttps://doi.org/10.1007/s001530050130openalex-snapshot
Undecidability results on two-variable logics
inferred← citeshttps://doi.org/10.1007/s00236-016-0256-3openalex-snapshot
Metric propositional neighborhood logic with an equivalence relation
inferred← citeshttps://doi.org/10.1007/s00778-024-00838-zopenalex-snapshot
Ingress: an automated incremental graph processing system
inferred← citeshttps://doi.org/10.1007/s10270-011-0195-yopenalex-snapshot
Metric propositional neighborhood logics on natural numbers
inferred← citeshttps://doi.org/10.1007/s10472-010-9176-zopenalex-snapshot
A description logic based situation calculus
inferred← citeshttps://doi.org/10.1007/s10703-006-0019-9openalex-snapshot
Bounded model checking of infinite state systems
inferred← citeshttps://doi.org/10.1007/s10817-022-09656-wopenalex-snapshot
Semantically-Guided Goal-Sensitive Reasoning: Decision Procedures and the Koala Prover
inferred← citeshttps://doi.org/10.1007/s10849-005-5788-9openalex-snapshot
Deciding Regular Grammar Logics with Converse Through First-Order Logic
inferred← citeshttps://doi.org/10.1007/s10849-010-9126-5openalex-snapshot
An Event-Based Fragment of First-Order Logic over Intervals
inferred← citeshttps://doi.org/10.1007/s11225-004-6044-zopenalex-snapshot
All Normal Extensions of S5-squared Are Finitely Axiomatizable
inferred← citeshttps://doi.org/10.1007/s11225-015-9647-7openalex-snapshot
The Decision Problem of Modal Product Logics with a Diagonal, and Faulty Counter Machines
inferred← citeshttps://doi.org/10.1007/s11225-018-9815-7openalex-snapshot
Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter
inferred← citeshttps://doi.org/10.1007/s11225-024-10124-2openalex-snapshot
A Version of Predicate Logic with Two Variables That has an Incompleteness Property
inferred← citeshttps://doi.org/10.1016/b978-044451541-4/50018-xopenalex-snapshot
Löwenheim-Skolem Theorems
inferred← citeshttps://doi.org/10.1016/j.apal.2004.01.003openalex-snapshot
The guarded fragment with transitive guards
inferred← citeshttps://doi.org/10.1016/j.apal.2009.07.003openalex-snapshot
Propositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensions
inferred← citeshttps://doi.org/10.1016/j.apal.2021.103042openalex-snapshot
The fluted fragment with transitive relations
inferred← citeshttps://doi.org/10.1016/j.apal.2026.103811openalex-snapshot
Superintuitionistic predicate logics of linear Kripke frames: undecidability with two individual variables
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103785openalex-snapshot
Logical separability of labeled data examples under ontologies
inferred← citeshttps://doi.org/10.1016/j.artint.2023.103997openalex-snapshot
Lifted inference with tree axioms
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104114openalex-snapshot
Lifted algorithms for symmetric weighted first-order model sampling
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.02.008openalex-snapshot
A Prolog-based Query Language for OWL
inferred← citeshttps://doi.org/10.1016/j.ic.2006.08.001openalex-snapshot
On the complexity of the two-variable guarded fragment with transitive guards
inferred← citeshttps://doi.org/10.1016/j.ic.2014.08.004openalex-snapshot
Complexity of two-variable dependence logic and IF-logic
inferred← citeshttps://doi.org/10.1016/j.ijar.2026.109832openalex-snapshot
A fast model counting algorithm for two-variable logic with counting and modulo counting quantifiers
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106113openalex-snapshot
Statistical EL is ExpTime-complete
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106122openalex-snapshot
A simple combinatorial proof for the small model property of two-variable logic
inferred← citeshttps://doi.org/10.1016/j.jlap.2006.12.001openalex-snapshot
A logic of reachable patterns in linked data-structures
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.030openalex-snapshot
Adding one or more equivalence relations to the interval temporal logic ABB¯
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115319openalex-snapshot
Monodic fragments of probabilistic first-order temporal logic with bounded semantics
inferred← citeshttps://doi.org/10.1016/j.websem.2022.100721openalex-snapshot
Satisfiability and containment of recursive SHACL
inferred← citeshttps://doi.org/10.1016/s0022-0000(02)00032-6openalex-snapshot
Integrity constraints for XML
inferred← citeshttps://doi.org/10.1016/s0168-0072(96)00047-4openalex-snapshot
Canonization for two variables and puzzles on the square
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00308-9openalex-snapshot
On logics with two variables
inferred← citeshttps://doi.org/10.1016/s0747-7171(02)00092-5openalex-snapshot
Deciding the guarded fragments by resolution
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80006-1openalex-snapshot
3 Complexity of modal logic
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80008-5openalex-snapshot
5 Model theory of modal logic
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03003-9openalex-snapshot
Chapter 3 Description Logics
inferred← citeshttps://doi.org/10.1017/bsl.2021.17openalex-snapshot
REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.006openalex-snapshot
Algebras and General Frames
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.007openalex-snapshot
Computability and Complexity
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.012openalex-snapshot
A Guide to the Literature
inferred← citeshttps://doi.org/10.1017/s1755020309990086openalex-snapshot
LOGICS FOR THE RELATIONAL SYLLOGISTIC
inferred← citeshttps://doi.org/10.1023/a:1005235713913openalex-snapshot
On Modal Logics Characterized by Models with Relative Accessibility Relations: Part I
inferred← citeshttps://doi.org/10.1023/a:1005260600511openalex-snapshot
On Modal Logics Characterized by Models with Relative Accessibility Relations: Part II
inferred← citeshttps://doi.org/10.1023/a:1016596721799openalex-snapshot
Complexity and Nicety of Fluted Logic
inferred← citeshttps://doi.org/10.1023/a:1021312628326openalex-snapshot
An Elementary Construction for a Non-elementary Procedure
inferred← citeshttps://doi.org/10.1023/a:1023383112908openalex-snapshot
All Proper Normal Extensions of S5-square have the Polynomial Size Model Property
inferred← citeshttps://doi.org/10.1080/11663081.1999.10510976openalex-snapshot
The Range of Modal Logic
inferred← citeshttps://doi.org/10.1080/11663081.2015.1018801openalex-snapshot
Separation logics and modalities: a survey
inferred← citeshttps://doi.org/10.1080/11663081.2018.1547515openalex-snapshot
Lattice logic as a fragment of (2-sorted) residuated modal logic
inferred← citeshttps://doi.org/10.1080/11663081.2019.1703469openalex-snapshot
Modal translation of substructural logics
inferred← citeshttps://doi.org/10.1093/jigpal/6.1.73openalex-snapshot
Products of modal logics, part 1
inferred← citeshttps://doi.org/10.1093/jigpal/jzy016openalex-snapshot
Two decision problems in Contact Logics
inferred← citeshttps://doi.org/10.1093/logcom/9.2.197openalex-snapshot
Complexity of products of modal logics
inferred← citeshttps://doi.org/10.1093/logcom/9.3.319openalex-snapshot
Expressive number restrictions in description logics
inferred← citeshttps://doi.org/10.1093/logcom/exaa041openalex-snapshot
Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages
inferred← citeshttps://doi.org/10.1093/logcom/exaa091openalex-snapshot
Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages
inferred← citeshttps://doi.org/10.1093/logcom/exab030openalex-snapshot
Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages
inferred← citeshttps://doi.org/10.1093/logcom/exaf042openalex-snapshot
The adjacent fragment and Quine’s limits of decision
inferred← citeshttps://doi.org/10.1093/logcom/exaf068openalex-snapshot
On two-variable first-order logic with a partial order
inferred← citeshttps://doi.org/10.1093/logcom/exl034openalex-snapshot
Complexity of the Guarded Two-variable Fragment with Counting Quantifiers
inferred← citeshttps://doi.org/10.1093/logcom/exv075openalex-snapshot
Equivalence closure in the two-variable guarded fragment
inferred← citeshttps://doi.org/10.1093/logcom/exz012openalex-snapshot
On the satisfiability problem for fragments of two-variable logic with one transitive relation
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.001.0001openalex-snapshot
Fragments of First-Order Logic
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0007openalex-snapshot
Counting with one variable
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0008openalex-snapshot
Counting with two variables
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0013openalex-snapshot
Equivalence and counting
inferred← citeshttps://doi.org/10.1109/lics.1997.614950openalex-snapshot
First-order logic with two variables and unary temporal logic
inferred← citeshttps://doi.org/10.1109/lics.1997.614957openalex-snapshot
Two-variable logic with counting is decidable
inferred← citeshttps://doi.org/10.1109/lics.1997.614958openalex-snapshot
Complexity of two-variable logic with counting
inferred← citeshttps://doi.org/10.1109/lics.1998.705684openalex-snapshot
On the boundedness problem for two-variable first-order logic
inferred← citeshttps://doi.org/10.1109/lics.1999.782580openalex-snapshot
Two-variable descriptions of regularity
inferred← citeshttps://doi.org/10.1109/lics.1999.782582openalex-snapshot
The two-variable guarded fragment with transitive relations
inferred← citeshttps://doi.org/10.1109/lics.2001.932491openalex-snapshot
On the decision problem for the guarded fragment with transitivity
inferred← citeshttps://doi.org/10.1109/lics.2005.49openalex-snapshot
Small Substructures and Decidability Issues for First-Order Logic with Two Variables
inferred← citeshttps://doi.org/10.1109/lics.2006.51openalex-snapshot
Two-Variable Logic on Words with Data
inferred← citeshttps://doi.org/10.1109/lics.2009.39openalex-snapshot
On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations
inferred← citeshttps://doi.org/10.1109/lics.2011.14openalex-snapshot
Complexity of Two-Variable Dependence Logic and IF-Logic
inferred← citeshttps://doi.org/10.1109/lics.2012.43openalex-snapshot
The Complexity of Decomposing Modal and First-Order Theories
inferred← citeshttps://doi.org/10.1109/lics.2012.53openalex-snapshot
Two-Variable First-Order Logic with Equivalence Closure
inferred← citeshttps://doi.org/10.1109/lics.2013.12openalex-snapshot
Two-Variable Logic with Counting and Trees
inferred← citeshttps://doi.org/10.1109/lics.2017.8005073openalex-snapshot
Herbrand property, finite quasi-Herbrand models, and a Chandra-Merlin theorem for quantified conjunctive queries
inferred← citeshttps://doi.org/10.1109/lics.2017.8005094openalex-snapshot
A fine-grained hierarchy of hard problems in the separated fragment
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470502openalex-snapshot
Towards a more efficient approach for the satisfiability of two-variable logic
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470511openalex-snapshot
On Logics and Homomorphism Closure
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470585openalex-snapshot
Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470734openalex-snapshot
Finite Model Theory of the Triguarded Fragment and Related Logics
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175742openalex-snapshot
On Exact Sampling in the Two-Variable Fragment of First-Order Logic
inferred← citeshttps://doi.org/10.1109/nafips.2006.365433openalex-snapshot
First Order Probabilistic Logic
inferred← citeshttps://doi.org/10.1109/time.2014.26openalex-snapshot
Metric Propositional Neighborhood Logic with an Equivalence Relation
inferred← citeshttps://doi.org/10.1111/phc3.12072openalex-snapshot
Dependence Logic: A survey of some recent work
inferred← citeshttps://doi.org/10.1134/s1064562422700053openalex-snapshot
Computational Complexity of Theories of a Binary Predicate with a Small Number of Variables
inferred← citeshttps://doi.org/10.1137/120900095openalex-snapshot
Two-Variable First-Order Logic with Equivalence Closure
inferred← citeshttps://doi.org/10.1137/130943625openalex-snapshot
Regular Graphs and the Spectra of Two-Variable Logic with Counting
inferred← citeshttps://doi.org/10.1137/22m1504792openalex-snapshot
Two Variable Logic with Ultimately Periodic Counting
inferred← citeshttps://doi.org/10.1137/s0097539797323005openalex-snapshot
Complexity Results for First-Order Two-Variable Logic with Counting
inferred← citeshttps://doi.org/10.1145/2559947openalex-snapshot
Using tableau to decide description logics with full role negation and identity
inferred← citeshttps://doi.org/10.1145/2603088.2603117openalex-snapshot
Logics with counting and equivalence
inferred← citeshttps://doi.org/10.1145/2603088.2603134openalex-snapshot
Decidability of weak logics with deterministic transitive closure
showing the first 200 of 288 · page through all 288
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.