Solving Combinatorial Problems with Regular Local Search Algorithms
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Annotated Hyperresolution for Non-horn Regular Multiple-Valued Logics
ISMIS '00 Proceedings of the 12th International Symposium on Foundations of Intelligent Systems
Extending Polynomiality to a Class of Non-clausal Many-Valued Horn-Like Formulas
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Complexity of many-valued logics
Beyond two
Automated theorem proving by resolution in non-classical logics
Annals of Mathematics and Artificial Intelligence
Exploiting multivalued knowledge in variable selection heuristics for SAT solvers
Annals of Mathematics and Artificial Intelligence
On the refutational completeness of signed binary resolution and hyperresolution
Fuzzy Sets and Systems
New polynomial classes for logic-based abduction
Journal of Artificial Intelligence Research
The Helly property and satisfiability of Boolean formulas defined on set families
European Journal of Combinatorics
Mapping CSP into many-valued SAT
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Knowledge Compilation Using Interval Automata and Applications to Planning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Mapping problems with finite-domain variables to problems with boolean variables
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming, which can be embedded into the first. The underlying basic idea is to generalise the classical notion of a literal by adorning an atomic formula with a sign or label which in general consists of a possibly ordered set of truth values. In this paper we relate signed logic and classical logic more closely than before by defining two new transformations between them. As a byproduct we obtain a number of new complexity results and proof procedures for signed logics.