Pages that link to "Item:Q1820593"

The following pages link to The Alexander Method - a technique for the processing of recursive axioms in deductive databases (Q1820593):

Displaying 17 items.

• Precise interprocedural dataflow analysis with applications to constant propagation (Q671681) (← links)
• Abstract interpretation: a kind of magic (Q673498) (← links)
• Incorporating top-down information into bottom-up hypothetical reasoning (Q688821) (← links)
• An efficient strategy for non-Horn deductive databases (Q753478) (← links)
• The semantics of incomplete databases as an expression of preferences (Q753482) (← links)
• A logical characterization of forward and backward chaining in the inverse method (Q928660) (← links)
• A transformation system for deductive database modules with perfect model semantics (Q1208734) (← links)
• Recursive query processing: The power of logic (Q1262144) (← links)
• A relational approach to logic programming: The extended Alexander method (Q1263276) (← links)
• Bottom-up abstract interpretation of logic programs (Q1318725) (← links)
• Towards an efficient evaluation of recursive aggregates in deductive databases (Q1326572) (← links)
• Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction (Q1344881) (← links)
• Parallelism in logic programs (Q1360680) (← links)
• Loop checking in SLD-derivations by well-quasi-ordering of goals (Q1575249) (← links)
• An Improved Depth-First Control Strategy for Query-Subquery Nets in Evaluating Queries to Horn Knowledge Bases (Q3192964) (← links)
• MGTP: A model generation theorem prover — Its advanced features and applications — (Q4610311) (← links)
• Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)