Pages that link to "Item:Q2551698"
From MaRDI portal
The following pages link to Linear resolution with selection function (Q2551698):
Displaying 50 items.
- Mark Stickel: his earliest work (Q287332) (← links)
- Abductive inference methods in problems of job planning in complex objects (Q357155) (← links)
- Synthesis of list algorithms by mechanical proving (Q485837) (← links)
- The relative complexity of analytic tableaux and SL-resolution (Q687165) (← links)
- Linearity and regularity with negation normal form (Q703486) (← links)
- Termination of floating-point computations (Q850498) (← links)
- An epistemic model of logic programming (Q918192) (← links)
- A logical characterization of forward and backward chaining in the inverse method (Q928660) (← links)
- Hierarchical deduction (Q1098332) (← links)
- A Prolog technology theorem prover: Implementation by an extended Prolog compiler (Q1114446) (← links)
- A logic for default reasoning (Q1140434) (← links)
- An extension to linear resolution with selection function (Q1160497) (← links)
- A simplified problem reduction format (Q1170894) (← links)
- Reduction rules for resolution-based systems (Q1187214) (← links)
- Linear resolution for consequence finding (Q1199916) (← links)
- A Prolog technology theorem prover: A new exposition and implementation in Prolog (Q1199932) (← links)
- Refutation graphs (Q1226867) (← links)
- Recursive query processing: The power of logic (Q1262144) (← links)
- Theorem proving by chain resolution (Q1274972) (← links)
- Tractability through symmetries in propositional calculus (Q1332641) (← links)
- Controlled integration of the cut rule into connection tableau calculi (Q1344875) (← links)
- On the termination of clause graph resolution (Q1344889) (← links)
- Generalized disjunctive well-founded semantics for logic programs. (Q1354026) (← links)
- Clause trees: A tool for understanding and implementing resolution in automated reasoning (Q1402732) (← links)
- Stratified resolution (Q1404977) (← links)
- Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques (Q1640636) (← links)
- Weak generalized closed world assumption (Q1825049) (← links)
- The \(Q^*\) algorithm - a search strategy for a deductive question-answering system (Q1844090) (← links)
- A typed resolution principle for deduction with conditional typing theory (Q1855225) (← links)
- A logic programming system for nonmonotonic reasoning (Q1891266) (← links)
- Near-Horn Prolog and the ancestry family of procedures (Q1924724) (← links)
- Complexity analysis of propositional resolution with autarky pruning (Q1961454) (← links)
- Milestones from the Pure Lisp Theorem Prover to ACL2 (Q2280212) (← links)
- On the use of stochastic local search techniques to revise first-order logic theories from examples (Q2361575) (← links)
- Towards a unified model of search in theorem-proving: subgoal-reduction strategies (Q2456542) (← links)
- Linear resolution with selection function (Q2551698) (← links)
- A note on linear resolution strategies in consequence-finding (Q2557565) (← links)
- Efficient description logic reasoning in Prolog: The DLog system (Q3393230) (← links)
- Logic and functional programming by retractions (Q3817574) (← links)
- (Q4057637) (← links)
- A note on answer extraction in resolution-based systems (Q4185847) (← links)
- MRPPS?An interactive refutation proof procedure system for question-answering (Q4766066) (← links)
- On Exponential Lower Bounds for Partially Ordered Resolution (Q5015597) (← links)
- On Linear Resolution (Q5015599) (← links)
- An Interactive Driver for Goal-directed Proof Strategies (Q5166499) (← links)
- How to Produce Information About a Given Entity Using Automated Deduction Methods (Q5170287) (← links)
- Proving with BDDs and control of information (Q5210793) (← links)
- The complexity of resolution refinements (Q5444704) (← links)
- A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs (Q5504599) (← links)
- Fuzzy logic programming (Q5946475) (← links)