On non-determinism in machines and languages
Annals of Mathematics and Artificial Intelligence
An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
Annals of Mathematics and Artificial Intelligence
The Complexity of Read-Once Resolution
Annals of Mathematics and Artificial Intelligence
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
Theoretical Computer Science
NP-Completeness of Refutability by Literal-Once Resolution
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
On the structure of some classes of minimal unsatisfiable formulas
Discrete Applied Mathematics - The renesse issue on satisfiability
Lean clause-sets: generalizations of minimally unsatisfiable clause-sets
Discrete Applied Mathematics - The renesse issue on satisfiability
Homomorphisms of conjunctive normal forms
Discrete Applied Mathematics - The renesse issue on satisfiability
Formal methods for the validation of automotive product configuration data
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
AMUSE: a minimally-unsatisfiable subformula extractor
Proceedings of the 41st annual Design Automation Conference
The Complexity of Homomorphisms and Renamings for Minimal Unsatisfiable Formulas
Annals of Mathematics and Artificial Intelligence
Extension and Equivalence Problems for Clause Minimal Formulae
Annals of Mathematics and Artificial Intelligence
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
Journal of Computer and System Sciences
Recognizing frozen variables in constraint satisfaction problems
Theoretical Computer Science
Complexities of homomorphism and isomorphism for definite logic programs
Journal of Computer Science and Technology
Redundancy in logic I: CNF propositional formulae
Artificial Intelligence
Density condensation of boolean formulas
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Local-search Extraction of MUSes
Constraints
Redundancy in logic II: 2CNF and Horn propositional formulae
Artificial Intelligence
Note: On the complexity of non-unique probe selection
Theoretical Computer Science
Redundancy in logic III: Non-monotonic reasoning
Artificial Intelligence
Complexity of DNF minimization and isomorphism testing for monotone formulas
Information and Computation
Computational complexity of quantified Boolean formulas with fixed maximal deficiency
Theoretical Computer Science
An approach for extracting a small unsatisfiable core
Formal Methods in System Design
Linear-Time Reductions of Resolution Proofs
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
Extracting MUCs from Constraint Networks
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Dealing Automatically with Exceptions by Introducing Specificity in ASP
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
A simplified way of proving trade-off results for resolution
Information Processing Letters
On the Complexity of Semantic Self-minimization
Electronic Notes in Theoretical Computer Science (ENTCS)
Boosting a complete technique to find MSS and MUS thanks to a local search oracle
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Redundancy in logic I: CNF propositional formulae
Artificial Intelligence
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
How many conflicts does it need to be unsatisfiable?
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
An upper bound for the circuit complexity of existentially quantified Boolean formulas
Theoretical Computer Science
Sets of boolean connectives that make argumentation easier
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Faster extraction of high-level minimal unsatisfiable cores
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
On deciding MUS membership with QBF
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Variable minimal unsatisfiability
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Deriving small unsatisfiable cores with dominators
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
The Complexity of Reasoning for Fragments of Autoepistemic Logic
ACM Transactions on Computational Logic (TOCL)
Finding relations among linear constraints
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Minimal false quantified boolean formulas
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Extracting minimum unsatisfiable cores with a greedy genetic algorithm
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Discrete Optimization
Towards efficient MUS extraction
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
On efficient computation of variable MUSes
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Fixed-parameter tractability of satisfying beyond the number of variables
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Improved single pass algorithms for resolution proof reduction
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Understanding, improving and parallelizing MUS finding using model rotation
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Improved single pass algorithms for resolution proof reduction
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Semantic acyclicity on graph databases
Proceedings of the 32nd symposium on Principles of database systems
Core minimization in SAT-based abstraction
Proceedings of the Conference on Design, Automation and Test in Europe
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.02 |