Pages that link to "Item:Q1229761"

The following pages link to Complexity and related enhancements for automated theorem-proving programs (Q1229761):

Displaying 26 items.

• Refinements to depth-first iterative-deepening search in automatic theorem proving (Q582116) (← links)
• Conflict resolution: a first-order resolution calculus with decision literals and conflict-driven clause learning (Q682374) (← links)
• Experiments with discrimination-tree indexing and path indexing for term retrieval (Q688554) (← links)
• The problem of demodulator adjunction (Q688566) (← links)
• The problem of demodulating across argument and literal boundaries (Q688583) (← links)
• A new use of an automated reasoning assistant: Open questions in equivalential calculus an the study of infinite domains (Q759491) (← links)
• Basic research problems: The problem of choosing the representation, inference rule, and strategy (Q809627) (← links)
• A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic (Q831915) (← links)
• Axiomatizing the skew Boolean propositional calculus (Q877820) (← links)
• Meeting the challenge of fifty years of logic (Q911807) (← links)
• A resolution framework for finitely-valued first-order logics (Q1185455) (← links)
• Complete demodulation for automatic theorem proving (Q1241989) (← links)
• The problem of naming and function replacement (Q1311398) (← links)
• The kernel strategy and its use for the study of combinatory logic (Q1311399) (← links)
• Uniform strategies: The CADE-11 theorem proving contest (Q1319384) (← links)
• Improving the efficiency of a hyperlinking-based theorem prover by incremental evaluation with network structures (Q1340966) (← links)
• The resonance strategy (Q1343396) (← links)
• The application of automated reasoning to questions in mathematics and logic (Q1354049) (← links)
• The application of automated reasoning to formal models of combinatorial optimization (Q1854978) (← links)
• Searching for circles of pure proofs (Q1904397) (← links)
• The anatomy of vampire. Implementing bottom-up procedures with code trees (Q1904404) (← links)
• Using hints to increase the effectiveness of an automated reasoning program: Case studies (Q1923820) (← links)
• Linear and unit-resulting refutations for Horn theories (Q1923821) (← links)
• Contradiction separation based dynamic multi-clause synergized automated deduction (Q2198231) (← links)
• Advanced indexing operations on substitution trees (Q4647547) (← links)
• Canonical Ground Horn Theories (Q4916071) (← links)