scientific article; zbMATH DE number 6970794
From MaRDI portal
DOI10.23638/LMCS-14(4:10)2018zbMath1403.68078arXiv1711.07786MaRDI QIDQ4553280
Reinhard Pichler, Stefan Woltran, Nadia Creignou
Publication date: 2 November 2018
Full work available at URL: https://arxiv.org/abs/1711.07786
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Classical propositional logic (03B05)
Related Items
An extension-based approach to belief revision in abstract argumentation, Choice logics and their computational properties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting complexity of propositional abduction
- Bases for Boolean co-clones
- The complexity of optimization problems
- Generalizations of Opt P to the polynomial hierarchy
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- On the algebraic structure of combinatorial problems
- What makes propositional abduction tractable
- A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison
- Closed systems of functions and predicates
- The complexity of logic-based abduction
- The complexity class θp2: Recent results and applications in AI and modal logic
- The complexity of satisfiability problems
- A Complete Classification of the Complexity of Propositional Abduction
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
- Partial Polymorphisms and Constraint Satisfaction Problems
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
- Belief revision and update: Complexity of model checking
