Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
Every logic program has a natural stratification and an iterated least fixed point model
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic programming as constructivism: a formalization and its application to databases
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Bottom-up beats top-down for datalog
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the power of Alexander templates
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Inference of monotonicity constraints in datalog programs
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Rule ordering bottom-up fixpoint evaluation of logic programs
Proceedings of the sixteenth international conference on Very large databases
Weakly stratified logic programs
Fundamenta Informaticae - Special issue on LOGIC PROGRAMMING
The expressive power of stratified logic programs
Information and Computation
Modular acyclicity and tail recursion in logic programs
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Glue-Nail: a deductive database system
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Magic templates: a spellbinding approach to logic programs
Journal of Logic Programming
Efficient bottom-up computation of queries on stratified databases
Journal of Logic Programming
A procedural semantics for well-founded negation in logic programs
Journal of Logic Programming
Modular stratification and magic sets for DATALOG programs with negation
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Structural totality and constraint stratification
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Tail recursion elimination in deductive databases
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
DOLORES: a system for logic-based retrieval of multimedia objects
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
An abstract machine for tabled execution of fixed-order stratified logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Deductive database languages: problems and solutions
ACM Computing Surveys (CSUR)
Learning probabilistic datalog rules for information classification and transformation
Proceedings of the tenth international conference on Information and knowledge management
Nonmonotonic reasoning in LDL++
Logic-based artificial intelligence
On the partial semantics for disjunctive deductive databases
Annals of Mathematics and Artificial Intelligence
Pushing extrema aggregates to optimize logic queries
Information Systems
Nondeterministic, Nonmonotonic Logic Databases
IEEE Transactions on Knowledge and Data Engineering
Binding Propagation Techniques for the Optimization of Bound Disjunctive Queries
IEEE Transactions on Knowledge and Data Engineering
A Computational Model for Functional Logic Deductive Databases
Proceedings of the 17th International Conference on Logic Programming
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
New Generation Computing
Data and knowledge in database systems: deductive databases
Handbook of data mining and knowledge discovery
Magic Sets and their application to data integration
Journal of Computer and System Sciences
A formal framework for reflective database access control policies
Proceedings of the 15th ACM conference on Computer and communications security
The consistency extractor system: Answer set programs for consistent query answering in databases
Data & Knowledge Engineering
Combining nonmonotonic knowledge bases with external sources
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Hybrid reasoning with rules and ontologies
Semantic techniques for the web
Pushing efficient evaluation of HEX programs by modular decomposition
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Rules and logic programming for the web
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Effective integration of declarative rules with external evaluations for semantic-web reasoning
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Magic sets and their application to data integration
ICDT'05 Proceedings of the 10th international conference on Database Theory
PIRE: an extensible IR engine based on probabilistic datalog
ECIR'05 Proceedings of the 27th European conference on Advances in Information Retrieval Research
First-Order encodings for modular nonmonotonic datalog programs
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Magic Sets for disjunctive Datalog programs
Artificial Intelligence
Finitely recursive programs: Decidability and bottom-up computation
AI Communications
Computing stable models for nonmonotonic existential rules
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
A class of “modularly stratified” logic programs is defined. Modular stratification generalizes stratification and local stratification, while allowing programs that are not expressible as stratified programs. For modularly stratified programs, the well-founded semantics coincides with the stable model semantics and makes every ground literal true or false. Modularly stratified programs are weakly stratified, but the converse is false. Unlike some weakly stratified programs, modularly stratified programs can be evaluated in a subgoal-at-a time fashion. An extension of top-down methods with memoing that handles this broader class of programs is presented. A technique for rewriting a modularly stratified program for bottom-up evaluation is demonstrated and extended to include magic-set techniques. The rewritten program, when evaluated bottom-up, gives correct answers according to the well-founded semantics, but much more efficiently than computing the complete well-founded model. A one-to-one correspondence between steps of the extended top-down method and steps during the bottom-up evaluation of the magic-rewritten program is exhibited, demonstrating that the complexity of the two methods is the same. Extensions of modular stratification to other operators such as set-grouping and aggregation, which have traditionally been stratified to prevent semantic difficulties, are discussed.