Approximate knowledge compilation: The first order case

Conference · Tue Dec 31 00:00:00 EST 1996

OSTI ID:430700

Val, A del ^[1]

---

1. Universidad Autonoma de Madrid (Spain)

Knowledge compilation procedures make a knowledge base more explicit so as make inference with respect to the compiled knowledge base tractable or at least more efficient. Most work to date in this area has been restricted to the propositional case, despite the importance of first order theories for expressing knowledge concisely. Focusing on (LUB) approximate compilation, our contribution is twofold: (1) We present a new ground algorithm for approximate compilation which can produce exponential savings with respect to the previously known algorithm. (2) We show that both ground algorithms can be lifted to the first order case preserving their correctness for approximate compilation.

• OSTI ID: 430700
• Report Number(s): CONF-960876-; TRN: 96:006521-0075
• Resource Relation: Conference: 13. National conference on artifical intelligence and the 8. Innovative applications of artificial intelligence conference, Portland, OR (United States), 4-8 Aug 1996; Other Information: PBD: 1996; Related Information: Is Part Of Proceedings of the thirteenth national conference on artificial intelligence and the eighth innovative applications of artificial intelligence conference. Volume 1 and 2; PB: 1626 p.
• Country of Publication: United States
• Language: English

Related Subjects

99 MATHEMATICS
COMPUTERS
INFORMATION SCIENCE
MANAGEMENT
LAW
MISCELLANEOUS
ARTIFICIAL INTELLIGENCE
KNOWLEDGE BASE
ALGORITHMS
MATHEMATICAL LOGIC