Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Tree clustering for constraint networks (research note)
Artificial Intelligence
Algorithms for testing the satisfiability of propositional formulae
Journal of Logic Programming
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
Linear resolution for consequence finding
Artificial Intelligence
Distributed deduction by clause-diffusion: distributed contraction and the Aquarius prover
Journal of Symbolic Computation - Special issue on design and implementation of symbolic computation systems
CYC: a large-scale investment in knowledge infrastructure
Communications of the ACM
Experiments with subdivision of search in distributed theorem proving
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
Interpolation Theorems for Resolution in Lower Predicate Calculus
Journal of the ACM (JACM)
Deciding Combinations of Theories
Journal of the ACM (JACM)
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
SPTHEO - A Parallel Theorem Prover
Journal of Automated Reasoning
Resolution versus Search: Two Strategies for SAT
Journal of Automated Reasoning
Distributed Repositories of Highly Expressive Reusable Ontologies
IEEE Intelligent Systems
(De)Composition of Situation Calculus Theories
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
The Search Efficiency of Theorem Proving Strategies
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Partitioning Methods for Satisfiability Testing on Large Formulas
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
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
Model-based diagnosis using structured system descriptions
Journal of Artificial Intelligence Research
Domain-independent extensions to GSAT: solving large structured satisfiability problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Completeness theorems for semantic resolution in consequence-finding
IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
Knowledge compilation using theory prime implicates
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Exploiting structure in policy construction
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
A taxonomy of theorem-proving strategies
Artificial intelligence today
A reflective proof system for reasoning in contexts
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
A sufficiently fast algorithm for finding close to optimal junction trees
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Interpolation for predefined types
Mathematical Structures in Computer Science
Interpolation in logics with constructors
Theoretical Computer Science
| Hi-index | 0.00 |
We investigate the possibility of improving the efficiency of reasoning through structure-based partitioning of logical theories, combined with partition-based logical reasoning strategies. To this end, we provide algorithms for reasoning with partitions of axioms in first-order and propositional logic. We analyze the computational benefit of our algorithms and detect those parameters of a partitioning that influence the efficiency of computation. These parameters are the number of symbols shared by a pair of partitions, the size of each partition, and the topology of the partitioning. Finally, we provide a greedy algorithm that automatically reformulates a given theory into partitions, exploiting the parameters that influence the efficiency of computation.