Exploiting polarity in multiple-valued inference systems

This paper surveys some polarity-based knowledge representational and automated reasoning techniques in the domain of many-valued logics.

[1]  Zohar Manna,et al.  Special Relations in Automated Deduction , 1985, ICALP.

[2]  Dale Schuurmans,et al.  Local search characteristics of incomplete SAT procedures , 2000, Artif. Intell..

[3]  Zbigniew Stachniak.  Resolution proof systems - an algebraic theory , 1996, Automated reasoning series.

[4]  Johan de Kleer,et al.  Exploiting Locality in a TMS , 1990, AAAI.

[5]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[6]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[7]  Christian G. Fermüller,et al.  Resolution-Based Theorem Proving for Manyvalued Logics , 1995, J. Symb. Comput..

[8]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[9]  Mukesh Dalal,et al.  Model-Theoretic Semantics and Tractable Algorithm for CNF-BCP , 1997, AAAI/IAAI.

[10]  Zbigniew Stachniak.  Resolution Proof Systems , 1996, Automated Reasoning Series.

[11]  Ian Horrocks,et al.  An Analysis of Empirical Testing for Modal Decision Procedures , 2000, Log. J. IGPL.

[12]  Neil V. Murray.  Completely Non-Clausal Theorem Proving , 1982, Artif. Intell..

[13]  Frank P. Coyle,et al.  Aaai '90 , 1990, IEEE Expert.

[14]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

[15]  Bart Selman,et al.  Noise Strategies for Improving Local Search , 1994, AAAI.

[16]  Reiner Hähnle.  Exploiting Data Dependencies in Many-Valued Logics , 1996, J. Appl. Non Class. Logics.

[17]  Reiner Hähnle.  Short Conjunctive Normal Forms in Finitely Valued Logics , 1994, J. Log. Comput..

[18]  G. Escalada-Imaz,et al.  The satisfiability problem in multiple-valued Horn formulae , 1994, Proceedings of 24th International Symposium on Multiple-Valued Logic (ISMVL'94).

[19]  Zbigniew Stachniak.  Polarity Guided Tractable Reasoning , 1999, AAAI/IAAI.

[20]  Roberto Sebastiani,et al.  Applying GSAT to Non-Clausal Formulas , 1993, J. Artif. Intell. Res..

[21]  James R. Slagle,et al.  Connection Based Strategies for Deciding Propositional Temporal Logic , 1997, AAAI/IAAI.

[22]  Zbigniew Stachniak.  Non-Clausal Reasoning with Definite Theories , 2001, Fundam. Informaticae.