Refine
Year of publication
- 2007 (14) (remove)
Language
- English (14) (remove)
Keywords
- Bluetooth (2)
- Campus Information System (2)
- Equality (2)
- Knowledge Compilation (2)
- Theorem Proving (2)
- University (2)
- Augmented Reality (1)
- Automated Theorem Proving (1)
- Automated Theorem Proving Systems (1)
- Bayes Procedures (1)
- E-KRHyper (1)
- Enhanced Reality (1)
- Horn Clauses (1)
- Hyper Tableau Calculus (1)
- IASON (1)
- MIA (1)
- MPEG-7 (1)
- Multi-robot System (1)
- Multiagent System (1)
- Ontology (1)
- Personalised Information Systems (1)
- Petri Nets (1)
- Probability (1)
- Propagation (1)
- RDF Graphs (1)
- Resource Description Framework (RDF) (1)
- Semantics (1)
- Stochastic Logic (1)
- Tableau Calculus (1)
- UML (1)
- Unified Modeling Language (UML ) (1)
- Web Ontology Language (OWL) (1)
Institute
- Institut für Informatik (14) (remove)
Generalized methods for automated theorem proving can be used to compute formula transformations such as projection elimination and knowledge compilation. We present a framework based on clausal tableaux suited for such tasks. These tableaux are characterized independently of particular construction methods, but important features of empirically successful methods are taken into account, especially dependency directed backjumping and branch local operation. As an instance of that framework an adaption of DPLL is described. We show that knowledge compilation methods can be essentially improved by weaving projection elimination partially into the compilation phase.