Article

A new algorithm for computing theory prime implicates compilations

Authors:

Pierre Marquis,

Samira SadaouiAuthors Info & Claims

AAAI'96: Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Pages 504 - 509

Published: 04 August 1996 Publication History

Abstract

We present a new algorithm (called TPI/BDD) for computing the theory prime implicates compilation of a knowledge base Σ. In contrast to many compilation algorithms, TPI/BDD does not require the prime implicates of Σ to be generated. Since their number can easily be exponential in the size of Σ, TPI/BDD can save a lot of computing. Thanks to TPI/BDD, we can now conceive of compiling knowledge bases impossible to before.

References

[1]

Bryant, R.E. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, 1992.

Digital Library

Google Scholar

[2]

De Kleer, J. An improved incremental algorithm for generating prime implicates. Proc. AAAI'92, 780-785, San Jose (CA), 1992.

Google Scholar

[3]

Del Val, A. Tractable databases: how to make propositional unit resolution complete through compilation. Proc. KR'94, 551-561, Bonn, 1994.

Crossref

Google Scholar

[4]

Forbus, K. and de Kleer, J. Building Problem Solvers. MIT Press, Cambridge (MA), 1993.

Crossref

Google Scholar

[5]

Hooker, J.N. and Vinay, V. Branching rules for satisfiability. Journal of Automated Reasoning, 15:359-383, 1995.

Crossref

Google Scholar

[6]

Jackson, P. and Pais, J. Computing prime implicants. Proc. CADE'90, 543-557, Kaiserslautem, 1990.

Crossref

Google Scholar

[7]

Kautz, H. and Selman, B. Forming concepts for fast inference. Proc. AAAI'92, 786-793, San Jose (CA), 1992.

Google Scholar

[8]

Madre, J.-C. and Coudert, O. A logically complete reasoning maintenance system based on a logical constraint solver. Proc. IJCAI'91, 294-299, Sydney, 1991. See also an extended version entitled «A complete reasoning maintenance system based on typed decision graphs», BULL research report, 1-26, Louveciennes.

Crossref

Google Scholar

[9]

Marquis, P. Knowledge compilation using theory prime implicates, Proc. IJCAI'95, 837-843, Montreal, 1995.

Crossref

Google Scholar

[10]

Mathieu, Ph. and Delahaye, J.-P. A kind of logical compilation for knowledge bases. Theoretical Computer Science, 131:197-218, 1994.

Digital Library

Google Scholar

[11]

Ngair, T.H. A new algorithm for incremental prime implicate generation. Proc. IJCAI'93, 46-51, Chambery, 1993.

Crossref

Google Scholar

[12]

Reiter, R. and de Kleer, J. Foundations of assumption-based truth maintenance systems: preliminary report. Proc. AAAI'87, 183-188, Seattle (WA), 1987.

Google Scholar

[13]

Schrag, R. Compilation for critically constrained knowledge bases. Proc. AAAI'96 (this issue), Portland (OR), 1996.

Crossref

Google Scholar

[14]

Slagle, J.R., Chang, C.L. and Lee, R.C.T. A new algorithm for generating prime implicants. IEEE Transactions on Computers, C-19(4):304-310, 1970.

Digital Library

Google Scholar

Cited By

View all

Bordeaux LMarques-Silva J(2012)Knowledge compilation with empowermentProceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science10.1007/978-3-642-27660-6_50(612-624)Online publication date: 21-Jan-2012
https://dl.acm.org/doi/10.1007/978-3-642-27660-6_50
Cadoli MDonini F(1997)A survey on knowledge compilationAI Communications10.5555/1216075.121608110:3,4(137-150)Online publication date: 1-Dec-1997
https://dl.acm.org/doi/10.5555/1216075.1216081

A new algorithm for computing theory prime implicates compilations
1. Theory of computation

Recommendations

Knowledge compilation using theory prime implicates
IJCAI'95: Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

In this paper, we are mainly concerned with logical compilations of propositional knowledge bases. We propose a new approach to equivalence-preserving knowledge compilation based on a generalization of the standard notion of prime implicate, the theory ...
An Incremental Method for Generating Prime Implicants/Implicates
An incremental method for generating prime implicants/implicates

Given the recent investigation of Clause Management Systems (CMSs) for ArtificialIntelligence applications, there is an urgent need for an efficient incremental method for generating prime implicants. Given a set of clauses F, a set of prime implicants ...

Comments

Information & Contributors

Information

Published In

AAAI'96: Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

August 1996

894 pages

ISBN:026251091X

Publisher

AAAI Press

Publication History

Published: 04 August 1996

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 17 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bordeaux LMarques-Silva J(2012)Knowledge compilation with empowermentProceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science10.1007/978-3-642-27660-6_50(612-624)Online publication date: 21-Jan-2012
https://dl.acm.org/doi/10.1007/978-3-642-27660-6_50
Cadoli MDonini F(1997)A survey on knowledge compilationAI Communications10.5555/1216075.121608110:3,4(137-150)Online publication date: 1-Dec-1997
https://dl.acm.org/doi/10.5555/1216075.1216081

Abstract

References

Cited By

Recommendations

Knowledge compilation using theory prime implicates

An Incremental Method for Generating Prime Implicants/Implicates

An incremental method for generating prime implicants/implicates

Comments

Information

Published In

Sponsors

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations