Skip to main content
SpringerLink
Log in

Extending Polynomiality to a Class of Non-clausal Many-Valued Horn-Like Formulas

  • Conference paper
  • First Online:
Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2143))

  • 728 Accesses

Abstract

In this paper we deal with the SAT problem in many-valued logics which is of relevant interest in many areas of Artificial Intelligence and Computer Science. Regarding tractability issues, several works have been previously published solving polynomially some clausal many-valued SAT problems. Thus, our aim is to show that certain non-clausal many-valued SAT problems can be solved in polynomial time too, extending in this way, earlier results from the clausal framework to the more general non-clausal one.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Altamirano and G. Escalada-Imaz. Algoritmos óptimos para algunas teorías de Horn factorizadas. In II Congrés Catalá d’Intel-ligéncia Artificial, CCIA’99, pages 31–38, Girona, Spain, october 1999.

    Google Scholar 

  2. E. Altamirano and G. Escalada-Imaz. An almost linear class of multiple-valued non-clausal Horn formulas. In X Congreso Español sobre Tecnologías y Lógica Fuzzy, ESTYLF’00, pages 145–150, Sevilla, Spain, September 2000.

    Google Scholar 

  3. E. Altamirano and G. Escalada-Imaz. An efficient proof method for non-clausal reasoning. In XII International Symposium on Methodologies for Intelligent Systems, volume 1932 of LNAI, pages 534–542, Charlotte, USA, October 2000. Springer-Verlag.

    Google Scholar 

  4. E. Altamirano and G. Escalada-Imaz. Finding tractable formulas in NNF. In I International Conference on Computational Logic, volume 1861 of LNAI, pages 493–507, London, UK, July 2000. Springer-Verlag.

    Google Scholar 

  5. B. Beckert, R. Hähnle, and F. Manya. Transformations between signed and classical clause logic. In Proc. Int. Symp. on Multiple Valued Logics, ISMVL’99, Freiburg, Germany, 1999.

    Google Scholar 

  6. G. Escalada-Imaz. Moteurs d’Inférence Lineaires en Chaŷnage-Avant pour une classe de Systémes de Régles. Technical Report LAAS-89172, Laboratoire D’Automatique et Analyse des Systemes, Toulouse, France, 1989.

    Google Scholar 

  7. G. Escalada-Imaz. Optimisation d’algorithmes d’inference monotone en logique des propositions et du premier ordre. PhD thesis, Université Paul Sabatier, Toulouse, France, 1989.

    Google Scholar 

  8. G. Escalada-Imaz and F. Manya. The satisfiability problem for multiple-valued horn formulae. In Proc. International Symposium on Multiple-Valued Logics, ISMVL’94, pages 250–256, Boston/MA, USA, 1994. IEEE Press, Los Alamitos.

    Google Scholar 

  9. G. Escalada-Imaz and F. Manya. On the 2-SAT problem for signed formulas. In Proc. Workshop/Conference on Many-Valued Logics for Computer Science Applications, COST Action 15., Barcelona, Spain, 1996.

    Google Scholar 

  10. G. Escalada-Imaz and A.M. Martínez-Enríquez. Motores de Inferencia de Complejidad Optima de encadenamiento hacia adelante para diversas clases de sistemas de reglas. Informática y Automática, 27(3):23–30, 1994.

    Google Scholar 

  11. M. Ghallab and G. Escalada-Imaz. A linear control algorithm for a class of rule-based systems. Journal of Logic Programming, (11):117–132, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  12. R. Hähnle. Automated deduction in multiple-valued logics, volume 10 of International Series of Monographs in Computer Sciences. Oxford University Press, 1993.

    Google Scholar 

  13. R. Hähnle. Short conjunctive normal forms in finitely-valued logics. Journal of Logic and Computation, 4(6):905–927, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  14. R. Hähnle. Exploiting data dependencies in many-valued logics. Journal of Applied Non-classical Logics, (6):49–69, 1996.

    MATH  MathSciNet  Google Scholar 

  15. R. Hahnle and G. Escalada-Imaz. Deduction in many-valued logics: A survey. Mathware and Soft Computing, 4(2):69–97, 1997.

    MathSciNet  Google Scholar 

  16. F. Manya. Proof Procedures for Multiple-Valued Propositional Logics. PhD thesis, Universidad Autónoma de Barcelona, 1996.

    Google Scholar 

  17. N.V. Murray. Completely Non-Clausal Theorem Proving. Artificial Intelligence, 18(1):67–85, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  18. R. Roy-Chowdhury-Dalal. Model theoretic semantics and tractable algorithm for CNF-BCP. In Proc. of the AAAI-97, pages 227–232, 1997.

    Google Scholar 

  19. Z. Stachniak. Non-clausal reasoning with propositional definite theories. In International Conferences on Artificial Intelligence and Symbolic Computation, volume 1476 of Lecture Notes in Computer Science, pages 296–307. Springer Verlag, 1998.

    Chapter  Google Scholar 

  20. Z. Stachniak. Polarity guided tractable reasoning. In International American Association on Artificial Intelligence, AAAI-99, pages 751–758, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Spanish Scientific Research Council (CSIC), Artificial Intelligence Research Institute (IIIA), Campus UAB, s/n, 08193, Bellaterra, Barcelona, Spain

    E. Altamirano & G. Escalada-Imaz

Authors
  1. E. Altamirano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Escalada-Imaz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Université Paul Sabatier, IRIT-CNRS, 118 route de Narbonne, 31062, Toulouse Cedex 4, France

    Salem Benferhat  & Philippe Besnard  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Altamirano, E., Escalada-Imaz, G. (2001). Extending Polynomiality to a Class of Non-clausal Many-Valued Horn-Like Formulas. In: Benferhat, S., Besnard, P. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2001. Lecture Notes in Computer Science(), vol 2143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44652-4_70

Download citation

  • DOI: https://doi.org/10.1007/3-540-44652-4_70

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42464-2

  • Online ISBN: 978-3-540-44652-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation