Disjunctive closures for knowledge compilation

&
Artificial Intelligence 216 (C):129-162 (2014)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2014.07.004

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,388

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

On the role of logical separability in knowledge compilation.Junming Qiu, Wenqing Li, Liangda Fang, Quanlong Guan, Zhanhao Xiao, Zhao-Rong Lai & Qian Dong - 2024 - Artificial Intelligence 328 (C):104077.
Information loss in knowledge compilation: A comparison of Boolean envelopes.Peter Schachte, Harald Søndergaard, Leigh Whiting & Kevin Henshall - 2010 - Artificial Intelligence 174 (9-10):585-596.
A Connectionist Realization Applying Knowledge-Compilation and Auto-Segmentation in a Symbolic Assignment Problem.Holger G. Ziegeler & Karl W. Kratky - 1990 - In G. Dorffner, Konnektionismus in Artificial Intelligence Und Kognitionsforschung. Berlin: Springer-Verlag. pp. 121--132.
Magic Sets for disjunctive Datalog programs.Mario Alviano, Wolfgang Faber, Gianluigi Greco & Nicola Leone - 2012 - Artificial Intelligence 187-188 (C):156-192.
Disjunctive merging: Quota and Gmin merging operators.Patricia Everaere, Sébastien Konieczny & Pierre Marquis - 2010 - Artificial Intelligence 174 (12-13):824-849.
Determining inference semantics for disjunctive logic programs.Yi-Dong Shen & Thomas Eiter - 2019 - Artificial Intelligence 277 (C):103165.
Constraint propagation techniques for the disjunctive scheduling problem.Ulrich Dorndorf, Erwin Pesch & Toàn Phan-Huy - 2000 - Artificial Intelligence 122 (1-2):189-240.
Graphically structured value-function compilation.Ronen I. Brafman & Carmel Domshlak - 2008 - Artificial Intelligence 172 (2-3):325-349.
A program for timetable compilation by a look-ahead method.A. L. Cherniavsky - 1972 - Artificial Intelligence 3:61-76.
Enhancing disjunctive logic programming systems by SAT checkers.Christoph Koch, Nicola Leone & Gerald Pfeifer - 2003 - Artificial Intelligence 151 (1-2):177-212.

Analytics

Added to PP
2020-12-22

Downloads
13 (#1,365,941)

6 months
6 (#572,300)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

On the hardness of approximate reasoning.Dan Roth - 1996 - Artificial Intelligence 82 (1-2):273-302.
On sentences which are true of direct unions of algebras.Alfred Horn - 1951 - Journal of Symbolic Logic 16 (1):14-21.
Structure identification in relational data.Rina Dechter & Judea Pearl - 1992 - Artificial Intelligence 58 (1-3):237-270.

View all 8 references / Add more references