Skip to main content

Some Simplified Forms of Reasoning with Distance-Based Entailments

  • Conference paper
Advances in Artificial Intelligence (Canadian AI 2008)

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

Abstract

Distance semantics is a robust way of handling dynamically evolving and possibly contradictory information. In this paper we show that in many cases distance-based entailments can be computerized in a general and modular way. We consider two different approaches for reasoning with distance semantics, apply them on some common cases, and show their relation to other known problems.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Arieli, O.: Commonsense reasoning by distance semantics. In: Proc. TARK 2007, pp. 33–41 (2007)

    Google Scholar 

  2. Arieli, O.: Distance-based paraconsistent logics. International Journal of Approximate Reasoning (in press, 2008) doi = 10.1016/j.ijar.2007.07.002

    Google Scholar 

  3. Bonet, M.L., Levy, J., Manyá, F.: Resolution for Max-SAT. Artificial Intelligence 171(8–9), 606–618 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cholvy, L., Garion, C.: A logic to reason on contradictory beliefs with a majority approach. In: IJCAI 2001 Workshop on Inconsistency in Data and Knowledge (2001)

    Google Scholar 

  5. Grove, A.: Two modellings for theory change. J. Phil. Logic 17, 157–180 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  6. Heras, F., Larrosa, J.: New inference rules for efficient Max-SAT solving. In: Proc. AAAI 2006, pp. 68–73. AAAI Press, Menlo Park (2006)

    Google Scholar 

  7. Joy, S., Mitchell, J., Borchers, B.: A branch-and-cut algorithm for max-sat and weighted max-sat. Satisfiability Problem: Theory and Applications 35 (1997)

    Google Scholar 

  8. Karloff, H., Zwick, U.: A 7/8-approximation algorithm for MAX 3SAT? In: Proc. FOCS 1997, IEEE Press, Los Alamitos (1997)

    Google Scholar 

  9. Konieczny, S., Pino Pérez, R.: Merging information under constraints: a logical framework. Journal of Logic and Computation 12(5), 773–808 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  10. Papadimitriou, C.: Computational complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  11. Xing, Z., Zhang, W.: axSolver: An efficient exact algorithm for (weighted) maximum satisfiability. Artificial Intelligence 164(1–2), 47–80 (2005)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Sabine Bergler

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arieli, O., Zamansky, A. (2008). Some Simplified Forms of Reasoning with Distance-Based Entailments. In: Bergler, S. (eds) Advances in Artificial Intelligence. Canadian AI 2008. Lecture Notes in Computer Science(), vol 5032. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68825-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68825-9_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68821-1

  • Online ISBN: 978-3-540-68825-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics