Skip to main content
SpringerLink
Log in

Polynomial algorithm of limited propositional deduction

  • Published:
Science in China Series E: Technological Sciences Aims and scope Submit manuscript

Abstract

For the problem of propositional satisfiability a polynomial algorithm of limited propositional deduction is proposed which can be viewed as a sort of boolean constraint propagation mechanism. It can be embodied in a backtracking search program for propositional satisfiability problems to make search efficient. The efficiency is gained in two ways: One is to use the algorithm to derive literals so as to overcome the ambiguities in search. The other is to exploit the consequence sets of unbound atoms generated during limited deduction as a heuristic measure for possible choices. The experiments have shown remarkable improvement in reducing search space.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Mackworth, A. K., Consistency in networks of relations,Artificial Intelligence, 1977, 8: 99.

    Article  MATH  Google Scholar 

  2. Kumar, V., Algorithms for constraint satisfaction problems: a survey,AI Magazine, 1992, 13(1): 32.

    Google Scholar 

  3. Nadel, B., Tree search and arc consistency in constraint satisfaction algorithms, inSearch in Artificial Intelligence (eds. Kanal, L., Kumar, V.), New York: Springer-Verlag, 1990, 287–342.

    Google Scholar 

  4. Dechter, R., Pearl, J., Network-based heuristics for constraint network,Artificial Intelligence, 1987, 34: 1.

    Article  MATH  MathSciNet  Google Scholar 

  5. Chang, C. L., Lee, R. C.,Symbolic Logic and Mechanical Theorem Proving, New York: Academic Press, 1973.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computing Technology, Chinese Academy of Sciences, 100080, Beijing, China

    Zhongzhi Shi & Lejian Liao

Authors
  1. Zhongzhi Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lejian Liao
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Project supported by the “863” High-Tech Program of China.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shi, Z., Liao, L. Polynomial algorithm of limited propositional deduction. Sci. China Ser. E-Technol. Sci. 42, 418–424 (1999). https://doi.org/10.1007/BF02916751

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02916751

Keywords

Search

Navigation