The Alexander Method - a technique for the processing of recursive axioms in deductive databases
From MaRDI portal
Publication:1820593
DOI10.1007/BF03037407zbMath0615.68062OpenAlexW2036240164WikidataQ114693233 ScholiaQ114693233MaRDI QIDQ1820593
R. Lescoeur, Jeremy Rohmer, Jean-Marc Kerisit
Publication date: 1986
Published in: New Generation Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03037407
Horn clausessaturationrelational querydeductive databasesrelational programrecursive axiomsvirtual relations
Related Items
Towards an efficient evaluation of recursive aggregates in deductive databases, Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction, Parallelism in logic programs, An Improved Depth-First Control Strategy for Query-Subquery Nets in Evaluating Queries to Horn Knowledge Bases, Analysis and Transformation of Constrained Horn Clauses for Program Verification, MGTP: A model generation theorem prover — Its advanced features and applications —, A logical characterization of forward and backward chaining in the inverse method, Precise interprocedural dataflow analysis with applications to constant propagation, Abstract interpretation: a kind of magic, Incorporating top-down information into bottom-up hypothetical reasoning, A transformation system for deductive database modules with perfect model semantics, On intuitionistic query answering in description bases, Recursive query processing: The power of logic, A relational approach to logic programming: The extended Alexander method, An efficient strategy for non-Horn deductive databases, The semantics of incomplete databases as an expression of preferences, Non-horn magic sets to incorporate top-down inference into bottom-up theorem proving, Loop checking in SLD-derivations by well-quasi-ordering of goals, Bottom-up abstract interpretation of logic programs
Cites Work
