Communications of the ACM
Making believers out of computers
Artificial Intelligence
NP is as easy as detecting unique solutions
Theoretical Computer Science
A logical framework for depiction and image interpretation
Artificial Intelligence
A finite presentation theorem for approximating logic programs
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Hierarchical knowledge bases and efficient disjunctive reasoning
Proceedings of the first international conference on Principles of knowledge representation and reasoning
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
Structure identification in relational data
Artificial Intelligence - Special volume on constraint-based reasoning
Tractable default reasoning
Natural language syntax and first-order inference
Artificial Intelligence
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
An empirical evaluation of knowledge compilation by theory approximation
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Artificial intelligence: theory and practice
Artificial intelligence: theory and practice
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Incremental recompilation of knowledge (extended abstract)
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Horn approximations of empirical data
Artificial Intelligence
Realization of a geometry-theorem proving machine
Computers & thought
Support set selection for abductive and default reasoning
Artificial Intelligence
Generating hard satisfiability problems
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Unit Refutations and Horn Sets
Journal of the ACM (JACM)
Renaming a Set of Clauses as a Horn Set
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A General Framework for Knowledge Compilation
PDK '91 Proceedings of the International Workshop on Processing Declarative Knowledge
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A completeness theorem and a computer program for finding theorems derivable from given axioms
A completeness theorem and a computer program for finding theorems derivable from given axioms
An analysis of approximate knowledge compilation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Journal of the ACM (JACM)
Learning first order universal Horn expressions
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Anytime approximate model reasoning
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Algorithms for propositional KB approximation
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A new method for consequence finding and compilation in restricted languages
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Learning to Reason with a Restricted View
Machine Learning
Learning Function-Free Horn Expressions
Machine Learning - The Eleventh Annual Conference on computational Learning Theory
Resource-bounded Relational Reasoning: Induction and Deduction Through Stochastic Matching
Machine Learning - Special issue on multistrategy learning
ACM Computing Surveys (CSUR)
On functional dependencies in q-Horn theories
Artificial Intelligence
Decomposable negation normal form
Journal of the ACM (JACM)
Monotonic reductions, representative equivalence, and compilation of intractable problems
Journal of the ACM (JACM)
Consistency restoriation and explanations in dynamic CSPs----application to configuration
Artificial Intelligence
Knowledge compilation = query rewriting + view synthesis
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Encoding domain knowledge for prositional planning
Logic-based artificial intelligence
Propositional lower bounds: Algorithms and complexity
Annals of Mathematics and Artificial Intelligence
Compute-intensive methods in artificial intelligence
Annals of Mathematics and Artificial Intelligence
An Efficient Algorithm to Generate Prime Implicants
Journal of Automated Reasoning
Logical Cryptanalysis as a SAT Problem
Journal of Automated Reasoning
Approximating Terminological Queries
FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
Approximation of Relations by Propositional Formulas: Complexity and Semantics
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Disjunctive Logic Programming: A Survey and Assessment
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Disjunctions of Horn Theories and Their Cores
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
A Logic for Anytime Deduction and Anytime Compilation
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Propositional Lower Bounds: Generalization and Algorithms
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Second-Order Quantifier Elimination in Modal Contexts
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Approximate Information Filtering on the Semantic Web
KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
Exploiting Partially Shared Ontologies for Multi-agent Communication
CIA '02 Proceedings of the 6th International Workshop on Cooperative Information Agents VI
Preprocessing of intractable problems
Information and Computation
Resource-Bounded Paraconsistent Inference
Annals of Mathematics and Artificial Intelligence
Artificial Intelligence - Special issue: Fuzzy set and possibility theory-based methods in artificial intelligence
On Stratified Belief Base Compilation
Annals of Mathematics and Artificial Intelligence
Compiling propositional weighted bases
Artificial Intelligence - Special issue on nonmonotonic reasoning
Complexity of propositional nested circumscription and nested abnormality theories
ACM Transactions on Computational Logic (TOCL)
Introduction to the special volume on reformulation
Artificial Intelligence - Special volume on reformulation
First order LUB approximations: characterization and algorithms
Artificial Intelligence - Special volume on reformulation
The universe of propositional approximations
Theoretical Computer Science - Logic, language, information and computation
Polynomial certificates for propositional classes
Information and Computation
Compilability of propositional abduction
ACM Transactions on Computational Logic (TOCL)
A survey on knowledge compilation
AI Communications
Complexity Issues in Multiagent Logics
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
What makes propositional abduction tractable
Artificial Intelligence
Optimizing requirements decisions with keys
Proceedings of the 4th international workshop on Predictor models in software engineering
Translating owl and semantic web rules into prolog: Moving toward description logic programs
Theory and Practice of Logic Programming
Learning to assign degrees of belief in relational domains
Machine Learning
Rough Sets and Approximation Schemes
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
AND/OR Multi-valued Decision Diagrams for Constraint Networks
Concurrency, Graphs and Models
Query Learning and Certificates in Lattices
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Approximation Schemes in Logic and Artificial Intelligence
Transactions on Rough Sets IX
Bit-precise reasoning with affine functions
SMT '08/BPR '08 Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning
A framework for semantic reconciliation of disparate earth observation thematic data
Computers & Geosciences
Compiling the Lexicographic Inference Using Boolean Cardinality Constraints
Canadian AI '09 Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence
Approximation of Ontologies in CASL
Proceedings of the 2006 conference on Formal Ontology in Information Systems: Proceedings of the Fourth International Conference (FOIS 2006)
Extending the Knowledge Compilation Map: Closure Principles
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
New Results for Horn Cores and Envelopes of Horn Disjunctions
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Compilation of query-rewriting problems into tractable fragments of propositional logic
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Approximate compilation for embedded model-based reasoning
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Propositional fragments for knowledge compilation and quantified boolean formulae
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Approximating OWL-DL ontologies
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Extending the knowledge compilation map: Krom, Horn, affine and beyond
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
New compilation languages based on structured decomposability
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Space efficiency of propositional knowledge representation formalisms
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
On the expressiveness of Levesque's normal form
Journal of Artificial Intelligence Research
AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
Journal of Artificial Intelligence Research
Incremental recompilation of knowledge
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Compiling knowledge into decomposable negation normal form
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Diagnosability testing with satisfiability algorithms
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
On the compilation of stratified belief bases under linear and possibilistic logic policies
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The comparative linguistics of knowledge representation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Stochastic search and phase transitions: AI meets physics
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Resource-bounded inference from inconsistent belief bases
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Computing strongest necessary and weakest sufficient conditions of first-order formulas
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A perspective on knowledge compilation
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
DPLL with a trace: from SAT to knowledge compilation
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Representing uncertain data: models, properties, and algorithms
The VLDB Journal — The International Journal on Very Large Data Bases
First order LUB approximations: characterization and algorithms
Artificial Intelligence - Special volume on reformulation
Introduction to the Special Volume on Reformulation
Artificial Intelligence - Special volume on reformulation
Knowledge compilation properties of trees-of-BDDs, revisited
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Solving strong-fault diagnostic models by model relaxation
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Polynomial certificates for propositional classes
Information and Computation
On the diffvierence of horn theories
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Learning rule representations from Boolean data
ICANN/ICONIP'03 Proceedings of the 2003 joint international conference on Artificial neural networks and neural information processing
Horn upper bounds and renaming
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Reformulating constraint satisfaction problems to improve scalability
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Relaxation of qualitative constraint networks
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Boolean approximation revisited
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Reformulating CSPs for scalability with application to geospatial reasoning
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Information loss in knowledge compilation: A comparison of Boolean envelopes
Artificial Intelligence
Reduced implicate/implicant tries
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
A subclass of Horn CNFs optimally compressible in polynomial time
Annals of Mathematics and Artificial Intelligence
Knowledge Compilation Using Interval Automata and Applications to Planning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Boolean affine approximation with binary decision diagrams
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Expressive approximations in DL-lite ontologies
AIMSA'10 Proceedings of the 14th international conference on Artificial intelligence: methodology, systems, and applications
Approximate knowledge compilation: the first order case
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Compilation for critically constrained knowledge bases
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
On the optimal approximation of queries using tractable propositional languages
Proceedings of the 14th International Conference on Database Theory
Approximations for explanations of inconsistency in partially known multi-context systems
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Linkless normal form for ALC concepts and TBoxes
KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
Efficient query processing with compiled knowledge bases
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Similarity, approximations and vagueness
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
On horn axiomatizations for sequential data
ICDT'05 Proceedings of the 10th international conference on Database Theory
Approximate model-based diagnosis using preference-based compilation
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Duality in knowledge compilation techniques
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
Normal forms for knowledge compilation
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
Existential closures for knowledge compilation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Complexity Issues in Multiagent Logics
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
From the body to the tools and back: A general framework for presence in mediated interactions
Interacting with Computers
Approximating Linear Order Inference in OWL 2 DL by Horn Compilation
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
On simplification of schema mappings
Journal of Computer and System Sciences
Making the most of your triple store: query answering in OWL 2 using an RL reasoner
Proceedings of the 22nd international conference on World Wide Web
Effectively-Propositional reasoning about reachability in linked data structures
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
From OWL to DL−Lite through efficient ontology approximation
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
Just-in-time compilation of knowledge bases
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Tractable approximations of consistent query answering for robust ontology-based data access
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Computing datalog rewritings beyond horn ontologies
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Definability of horn revision from horn contraction
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Belief revision within fragments of propositional logic
Journal of Computer and System Sciences
Anytime approximation in probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
Horn clause contraction functions
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Computational efficiency is a central concern in the design of knowledge representation systems. In order to obtain efficient systems, it has been suggested that one should limit the form of the statements in the knowledge base or use an incomplete inference mechanism. The former approach is often too restrictive for practical applications, whereas the latter leads to uncertainty about exactly what can and cannot be inferred from the knowledge base. We present a third alternative, in which knowledge given in a general representation language is translated (compiled) into a tractable form—allowing for efficient subsequent query answering.We show how propositional logical theories can be compiled into Horn theories that approximate the original information. The approximations bound the original theory from below and above in terms of logical strength. The procedures are extended to other tractable languages (for example, binary clauses) and to the first-order case. Finally, we demonstrate the generality of our approach by compiling concept descriptions in a general frame-based language into a tractable form.