Speeding up inferences using relevance reasoning: A formalism and algorithms

Artificial Intelligence

Volumn 97, Issue 1-2, 1997, Pages 83-136

  Levy, Alon Y ^a   Fikes, Richard E ^b   Sagiv, Yehoshua ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b STANFORD UNIVERSITY   (United States)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Constraints; Horn rules; Knowledge representation; Meta level reasoning; Relevance reasoning; Static analysis

Indexed keywords

ALGORITHMS; KNOWLEDGE BASED SYSTEMS; KNOWLEDGE REPRESENTATION; LEARNING SYSTEMS; QUERY LANGUAGES; THEOREM PROVING; TREES (MATHEMATICS);

RELEVANCE REASONING;

INFERENCE ENGINES;

EID: 0031354559     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(97)00049-0     Document Type: Article

References (93)

1. S. Abiteboul and R. Hull, Data functions, datalog and negation, in: Proceedings ACM SIGMOD 1988 International Conference on Management of Data (1988).
2. S. Addanki, R. Cremonini and J. Penberthy, Reasoning about assumptions in graphs of models, in: Proceedings IJCAI-89, Detroit, MI (1989).
3. A.R. Anderson and N.D. Belnap, Entailment (Princeton University Press, Princeton, NJ, 1975).
4. Y. Arens, C.A. Knoblock and W.-M. Shen, Query reformulation for dynamic information integration, Internat. J. Intelligent and Cooperative Information Systems 6 (2/3) (1996) 99-130.
5. A. Avron, Whither relevance logic?, J. Philos. Logic 21 (1992) 243-281.
6. F. Baader and B. Hollunder, A terminological knowledge representation system with complete inference algorithm, in: Proceedings Workshop on Processing Declarative Knowledge, PDK-91, Lecture Notes in Artificial Intelligence (Springer, Berlin, 1991) 67-86.
7. F. Bacchus, A.J. Grove, J.Y. Halpern and D. Koller, Statistical foundations for default reasoning, in: Proceedings IJCAI-93, Chambery, France (1993).
8. F. Bancilhon, D. Maier, Y. Sagiv and J. Ullman, Magic sets and other strange ways to implement logic programs, in: Proceedings 5th ACM Symposium on Principles of Database Systems (1986) 1-15.
9. C. Beeri and R. Ramakrishnan, On the power of magic, in: Proceedings 6th ACM Symposium on Principles of Database Systems (1987) 269-283.
10. J.A. Blakeley, N. Coburn and P.A. Larson, Updating derived relations: Detecting irrelevant and autonomously computable updates, Trans. Database Systems 14 (3) (1989) 369-400.
11. D. Bobrow, ed., Qualitative Reasoning about Physical Systems (North-Holland, Amsterdam, 1984).
12. A. Borgida and P. Patel-Schneider, A semantics and complete algorithm for subsumption in the CLASSIC description logic, J. Artif. Intell. Res. 1 (1994) 277-308.
13. A. Brodsky and Y. Sagiv, On termination of datalog programs, in: J.M. Nicolas W. Kim and S. Nishio, eds., Deductive and Object-Oriented Databases (North-Holland, Amsterdam, 1990) 47-64.
14. M. Bruynooghe, D. De Schreye and B. Krekels, Compiling control, J. Logic Programming 6 (1989) 135-162.
15. M. Bruynooghe, D. De Schreye and B. Martens, A general criterion for avoiding infinite unfolding during partial deduction of logic programs, in: Proceedings International Symposium on Logic Programming, Paris (1991) 117-131.
16. R. Carnap, Logical Foundations of Probability (University of Chicago Press, Chicago, IL, 1950).
17. A. Chandra, D. Kozen and L. Stockmeyer, Alternation, J. ACM 28 (1) (1981) 114-133.
18. C.L. Chang, Resolution plans in theorem proving, in: Proceedings IJCAI-79, Tokyo (1979) 143-148.
19. W.J. Clancey, The advantages of abstract control knowledge in expert system design, in: Proceedings AAAI-83, Washington, DC (Morgan Kaufmann, Los Altos, CA, 1983) 74-78.
20. P. Cousot and R. Cousot, Abstract interpretation and application to logic programs, J. Logic Programming 13 (2-3) (1992) 103-179.
21. A. Darwiche, A logical notion of conditional independence, Artificial Intelligence 97 (1997) 45-82 (this issue).
22. R. Davis, Diagnostic reasoning based on structure and behavior, Artificial Intelligence 24 (1984) 347-410.
23. D.L. Draper, Relevance measures for localized partial evaluation of belief networks, in: Working Notes of the AAAI Fall Symposium on Relevance (November 1994).
24. M. Dunn, Relevance logic and entailment, in: D. Gabbay and F. Guenthner, eds., Handbook of Philosophical Logic, Vol. III. Alternatives to Classical Logic (Reidel, Dordrecht, The Netherlands, 1986) 117-224.
25. C. Elkan, A decision procedure for conjunctive query disjointness, in: Proceedings 8th ACM Symposium on Principles of Database Systems (1989).
26. C. Elkan, Independence of logic database queries and updates, in: Proceedings 9th ACM Symposium on Principles of Database Systems (1990) 154-160.
27. T. Ellman, Abstraction via approximate symmetry, in: Proceedings IJCAI-93, Chambery, France (1993) 916-921.
28. O. Etzioni, Why PRODIGY/EBL works, in: Proceedings AAAI-90, Boston, MA (1990).
29. O. Etzioni, Acquiring search-control knowledge via static analysis, Artificial Intelligence 62 (1993).
30. O. Etzioni and S. Minton, Why EBL produces overly-specific knowledge: a critique of the PRODIGY approaches, in: Proceedings Machine Learning Conference, Aberdeen, Scotland (1992).
31. O. Etzioni and D. Weld, A softbot-based interface to the internet, Comm. ACM 37 (7) (1994) 72-76.
32. B. Falkenhainer and K. Forbus, Compositional modeling: finding the right model for the job, Artificial Intelligence 51 (1991) 95-143.
33. R. Fikes, M. Cutkosky, T. Gruber and J. Van Baalen, Knowledge sharing technology, project overview, Knowledge Systems Laboratory Tech. Rept. No. KSL 91-71, Stanford, CA (1991).
34. P. Gärdenfors, On the logic of relevance, Sythese 37 (1978) 351-367.
35. P. Gärdenfors, Knowledge in Flux: Modeling the Dynamics of Epistemic States (MIT Press, Cambridge, MA, 1988).
36. H. Geffner and J. Pearl, A framework for reasoning with defaults, in: H.E. Kyburg, R. Loui and G Carlson, eds., Knowledge Representation and Defeasible Reasoning (Academic Press, Dordrecht, The Netherlands, 1990).
37. M.R. Genesereth, An overview of metalevel architectures, in: Proceedings AAAI-83, Washington, DC (Morgan Kaufmann, Los Altos, CA, 1983) 119-123.
38. M.R. Genesereth, An agent-based framework for software interoperability, in: Proceedings Software Technology Conference, Los Angeles, CA (1992).
39. M.R. Genesereth and N.J. Nilsson, Logical Foundations of Artificial Intelligence (Morgan Kaufmann, Los Altos, CA, 1987).
40. F. Giunchiglia and T. Walsh, A theory of abstraction, Artificial Intelligence 56 (3) (1992).
41. R. Greiner, RLL-1: a representation language language, Stanford Heuristic Programming Project, HPP-80-9 (Working Paper), Stanford, CA (1980).
42. R. Greiner, Finding optimal derivation strategies in a redundant knowledge base, Artificial Intelligence 50 (1) (1991) 95-116.
43. R. Greiner, Learning efficient query processing strategies, in: Proceedings 11th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, San Diego, CA (1992).
44. R. Greiner and I. Jurišica, A statistical approach to solving the EBL utility problem, in: Proceedings AAAI-92, San Jose, CA (1992).
45. R.J. Hayes, Computation and deduction, in: Proceedings 1973 Mathematical Foundations of Computer Science Symposium (Czechoslovakian Academy of Sciences, 1973).
46. Y. Iwasaki and A.Y. Levy, Automated model selection for simulation, in: Proceedings AAAI-94, Seattle, WA (1994) 1183-1190.
47. J.M. Keynes, A Treatise on Probability (Macmillan, London, 1921).
48. M. Kifer, On safety, domain independence and capturability of database queries, in: Proceedings International Conference on Data and Knowledge Bases, Jerusalem (1988).
49. A. Klug, On conjunctive queries containing inequalities, J. ACM 35 (1) (1988) 146-160.
50. C.A. Knoblock, Learning abstraction hierarchies for problem solving, in: Proceedings AAAI-90, Boston, MA (Morgan Kaufmann, Los Altos, CA, 1990).
51. C.A. Knoblock and A.Y. Levy, eds., Working Notes of the AAAI Spring Symposium on Information Gathering from Heterogeneous Distributed Environments (American Association for Artificial Intelligence, 1995).
52. R. Kowalski, A proof procedure using connection graphs, J. ACM 22 (4) (1975) 572-595.
53. G. Lakemeyer, A logical account of relevance, in: Proceedings IJCAI-95, Montreal, Que. (1995) 853-859.
54. D.B. Lenat, R. Davis, J. Doyle and M.R. Genesereth, Reasoning about reasoning, in: F. Hayes-Roth, D.A. Waterman and D.B. Lenat, eds., Building Expert Systems (Addison Wesley, Reading, MA, 1983).
55. A.Y. Levy, Irrelevance reasoning in knowledge based systems, Ph.D. Thesis, Stanford University, Stanford, CA (1993).
56. A.Y. Levy, Creating abstractions using relevance reasoning, in: Proceedings AAAI-94, Seattle, WA (1994) 588-594.
57. A.Y. Levy, R.E. Fikes and Y. Sagiv, A proof-theoretic approach to irrelevance: foundations and applications, in: Working Notes of the AAAI Fall Symposium on Relevance (November 1994).
58. A.Y. Levy, I. Singh Mumick and Y. Sagiv, Query optimization by predicate move-around, in: Proceedings 20th VLDB Conference, Santiago, Chile (1994) 96-107.
59. A.Y. Levy, I. Singh Mumick, Y. Sagiv and O. Shmueli, Equivalence, query-reachability and satisfiability in datalog extensions, in: Proceedings 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Washington, DC (1993) 109-122.
60. A.Y. Levy, A. Rajaraman and J.J. Ordille, Query answering algorithms for information agents, in: Proceedings AAAI-96, Portland, OR (1996) 40-47.
61. A.Y. Levy and Y. Sagiv, Constraints and redundancy in Datalog, in: Proceedings 11th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, San Diego, CA (1992) 67-80.
62. A.Y. Levy and Y. Sagiv, Exploiting irrelevance reasoning to guide problem solving, in: Proceedings IJCAI-93, Chambery, France (1993) 138-144.
63. A.Y. Levy and Y. Sagiv, Queries independent of updates, in: Proceedings 19th VLDB Conference, Dublin, Ireland (1993) 171-181.
64. A.Y. Levy and Y. Sagiv, Semantic query optimization in datalog programs, in: Proceedings 14th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, San Jose, CA (1995) 163-173.
65. A.Y. Levy, D. Srivastava and T. Kirk, Data model and query evaluation in global information systems, J. Intelligent Information Systems (Special Issue on Networked Information Discovery and Retrieval) 5 (2) (1995).
66. N. Littlestone, Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm, Machine Learning 2 (1988) 285-318.
67. J.W. Lloyd and J.C. Shepherdson, Partial evaluation in logic programming, J. Logic Programming 11 (1991) 217-242.
68. S. Minton, Quantitative results concerning the utility of explanation based learning, in: Proceedings AAAI-88, St. Paul, MN (1988).
69. S. Minton, J. Carbonell, C. Knoblock, D. Kuokka, O. Etzioni and Y. Gil, Explanation based learning: a problem solving perspective, Artificial Intelligence 40 (1989) 63-118.
70. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference (Morgan Kaufmann, San Mateo, CA, 1988).
71. J. Pearl, System Z: a natural ordering of defaults with tractable applications to nonmonotic reasoning, in: M.Y. Vardi, ed., Theoretical Aspects of Reasoning about Knowledge (Morgan Kaufmann, Los Altos, CA, 1990) 121-135.
72. C. Petalson, The BACK system: an overview, in: Proc. SIGART Bull. 2 (3) (1991) 114-119.
73. D. Plaisted, Theorem proving with abstraction, Artificial Intelligence 16 (1981) 47-108.
74. R.B. Rao, R. Greiner and T. Hancock, Exploiting the absence of irrelevant information: what you don't know can help you, in: Working Notes of the AAAI Fall Symposium on Relevance (November 1994).
75. I.S. Rombauer and M. Rombauer-Becker, Joy of Cooking (Merrill, New York, 1975).
76. S. Russell, The complete guide to MRS, Tech. Rept. KSL-85-12, Knowledge Systems Laboratory, Department of Computer Science, Stanford University, CA (1985).
77. E.D. Sacerdoti, Planning in a hierarchy of abstraction spaces. Artificial Intelligence 5 (1974) 115-135.
78. Y. Sagiv and M. Yannakakis, Equivalence among relational expressions with the union and difference operators, J. ACM 27 (4) (1981) 633-655.
79. Y. Sagiv, On testing effective computability of magic programs, in: C. Delobel, M. Kifer and Y. Masunaga, eds., Proceedings 2nd International Conference on Deductive and Object-Oriented Databases, Munich, Germany (1991) 244-262.
80. Y. Sagiv, A termination test for logic programs, in: V. Saraswat and K. Ueda, eds., Proceedings 1991 International Symposium on Logic Programming (MIT Press, Cambridge, MA, 1991) 518-532.
81. A. Segre and C. Elkan, A high-performance explanation-based learning algorithm, Artificial Intelligence 69 (1994) 1-50.
82. O. Shmueli, Equivalence of datalog queries is undecidable, J. Logic Programming 15 (1993) 231-241.
83. [831 S. Sickel, A search technique for clause interconnectivity graphs, IEEE Trans. Comput. 25 (8) (1976) 823-835.
84. D. Smith, Controlling inference, Ph.D. Thesis, Stanford University, Stanford, CA (1986).
85. D.A. Smith and T.J. Hickey, Partial evaluation of a CLP language, in: Proceedings International Symposium on Logic Programming (1990) 119-138.
86. D. Srivastava and R. Ramakrishnan, Pushing constraint selections, J. Logic Programming 16 (3-4) (1993) 361-414.
87. D. Subramanian and M.R. Genesereth, The relevance of irrelevance, in: Proceedings IJCAI-87, Milan, Italy (Morgan Kaufmann, Los Altos, CA, 1987).
88. D. Subramanian, A theory of justified reformulations, Ph.D. Thesis, Stanford University, Stanford, CA (1989).
89. J.D. Ullman, Principles of Database and Knowledge-base Systems, Vois. I and II (Computer Science Press, Rockville, MD, 1989).
90. J.D. Ullman, Information integration using logical views, in: Proceedings International Conference on Database Theory (1997).
91. A. Van Gelder, A message passing framework for logical query evaluation, in: Proceedings ACM SIGMOD International Conference on Management of Data (1986) 155-165.
92. M.Y. Vardi, Automata theory for database theoreticians, in: Proceedings 8th Symposium on Principles of Database Systems (PODS) (March 1989) 83-92.
93. L. Vieille, Recursive query processing: the power of logic, Theoret. Comput. Sci. 69 (1989) 1-53.