The Complexity of Read-Once Resolution
Annals of Mathematics and Artificial Intelligence
NP-Completeness of Refutability by Literal-Once Resolution
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
SAT and ATPG: Boolean engines for formal hardware verification
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Complexity of argument-based default reasoning with specificity
AI Communications
Homomorphisms of conjunctive normal forms
Discrete Applied Mathematics - The renesse issue on satisfiability
Proceedings of the conference on Design, automation and test in Europe - Volume 1
Theory revision with queries: horn, read-once, and parity formulas
Artificial Intelligence
Regular disjunction-free default theories
Journal of Computer Science and Technology
On Exact Selection of Minimally Unsatisfiable Subformulae
Annals of Mathematics and Artificial Intelligence
Generalizations of Matched CNF Formulas
Annals of Mathematics and Artificial Intelligence
Extension and Equivalence Problems for Clause Minimal Formulae
Annals of Mathematics and Artificial Intelligence
On the complexity of resolution with bounded conjunctions
Theoretical Computer Science
Optimal refinement of rule bases
AI Communications
Narrow proofs may be spacious: separating space and width in resolution
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Complexity results for restricted credulous default reasoning
AI Communications
Complexity of argument-based default reasoning with specificity
AI Communications
Optimal refinement of rule bases
AI Communications
Complexity Results for 2CNF Default Theories
Fundamenta Informaticae
Complexity of the Unique Extension Problem in Default Logic
Fundamenta Informaticae
Boolean Functions as Models for Quantified Boolean Formulas
Journal of Automated Reasoning
Satisfiability of mixed Horn formulas
Discrete Applied Mathematics
Solving peptide sequencing as satisfiability
Computers & Mathematics with Applications
A detectability analysis of fault classes for Boolean specifications
Proceedings of the 2008 ACM symposium on Applied computing
Models and quantifier elimination for quantified Horn formulas
Discrete Applied Mathematics
Computational Complexity of Constraint Satisfaction
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
A new 3-CNF transformation by parallel-serial graphs
Information Processing Letters
Backdoor Sets of Quantified Boolean Formulas
Journal of Automated Reasoning
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
Comparison of semantics of disjunctive logic programs based on model-equivalent reduction
Journal of Computer Science and Technology
Journal of Computer Science and Technology
Reasoning about edits to feature models
ICSE '09 Proceedings of the 31st International Conference on Software Engineering
On odd and even cycles in normal logic programs
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Combinatorial Problems for Horn Clauses
Graph Theory, Computational Intelligence and Thought
Ground Interpolation for Combined Theories
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Exclusive and essential sets of implicates of Boolean functions
Discrete Applied Mathematics
Backdoor sets of quantified boolean formulas
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
A CNF class generalizing exact linear formulas
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Logic-based ontology comparison and module extraction, with an application to DL-Lite
Artificial Intelligence
A subclass of Horn CNFs optimally compressible in polynomial time
Annals of Mathematics and Artificial Intelligence
On approximate horn formula minimization
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Failed literal detection for QBF
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Generalized conflict-clause strengthening for satisfiability solvers
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Variable independence and resolution paths for quantified boolean formulas
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Predicate-C: an efficient and generic runtime system for predicate dispatch
Proceedings of the 6th Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems
Disjoint essential sets of implicates of a CQ Horn function
Annals of Mathematics and Artificial Intelligence
Equivalence models for quantified boolean formulas
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Worst case bounds for some NP-Complete modified Horn-SAT problems
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Minimal unsatisfiable sets: classification and bounds
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Boolean functions with a simple certificate for CNF complexity
Discrete Applied Mathematics
Variable minimal unsatisfiability
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Quantifier rewriting and equivalence models for quantified horn formulas
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
A SAT-based version space algorithm for acquiring constraint satisfaction problems
ECML'05 Proceedings of the 16th European conference on Machine Learning
Dependency quantified horn formulas: models and complexity
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Minimal false quantified boolean formulas
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
New & improved models for SAT-based bi-decomposition
Proceedings of the great lakes symposium on VLSI
The Multivariate Algorithmic Revolution and Beyond
Computing resolution-path dependencies in linear time ,
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Extended failed-literal preprocessing for quantified boolean formulas
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Efficient synthesis of feature models
Proceedings of the 16th International Software Product Line Conference - Volume 1
Complexity of the Unique Extension Problem in Default Logic
Fundamenta Informaticae
Complexity Results for 2CNF Default Theories
Fundamenta Informaticae
Local consistency and SAT-solvers
Journal of Artificial Intelligence Research
Contributions to the theory of practical quantified boolean formula solving
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Producing and verifying extremely large propositional refutations
Annals of Mathematics and Artificial Intelligence
Ordered direct implicational basis of a finite closure system
Discrete Applied Mathematics
Recovering and utilizing partial duality in QBF
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Efficient clause learning for quantified boolean formulas via QBF pseudo unit propagation
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Complexity issues related to propagation completeness
Artificial Intelligence
Boolean functions with long prime implicants
Information Processing Letters
A decomposition method for CNF minimality proofs
Theoretical Computer Science
| Hi-index | 0.01 |
From the Publisher:This introduction to classical logic emphasises computational aspects. The authors treat issues of complexity and algorithmic analysis that have traditionally not been considered the realm of mathematical logic, but which are vital in areas such as automated reasoning, knowledge engineering, logic programming and AI.In order to make the book suited for teaching and for self-study, the book includes a systematic account of theoretical results, as well as an exposition of those appropriate algorithms which incorporate them.