Canonical Ground Horn Theories (Q4916071): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OEIS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-37651-1_3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W64666703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on rewrite-based satisfiability procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rewriting approach to satisfiability procedures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equational inference, canonical proofs, and proof orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewrite-based Equational Theorem Proving with Selection and Simplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract congruence closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory reasoning in connection calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5789040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract canonical inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewrite-Based Satisfiability Procedures for Recursive Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Variable-inactivity and Polynomial Formula-Satisfiability Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory decision by decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rewrite programs: Semantics and relationship with prolog / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a foundation of completion procedures as semidecision procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On deciding satisfiability by theorem proving with speculative inferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completion Is an Instance of Abstract Canonical System Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5679729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4447230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on simplification orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract canonical presentations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving termination with multiset orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence, Uniqueness, and Construction of Rewrite Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deductive and inductive synthesis of equational programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4447217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding canonical sets of ground rewrite rules in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for testing unsatisfiability of ground Horn clauses with equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A completion procedure for conditional equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The integration of functions into logic programming: From theory to practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sentences which are true of direct unions of algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refutational theorem proving using term-rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewrite method for theorem proving in first order theory with equality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3028369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete proof of correctness of the Knuth-Bendix completion algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplifying conditional term rewriting systems: Unification, termination and confluence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On word problems in Horn theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and related enhancements for automated theorem-proving programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decision problem for some classes of sentences without quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof lengths for equational completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2859380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated deduction by theory resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4799892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency and Completeness of the Set of Support Strategy in Theorem Proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new method for the Boolean ring based theorem proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847001 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:44, 6 July 2024

scientific article; zbMATH DE number 6155885
Language Label Description Also known as
English
Canonical Ground Horn Theories
scientific article; zbMATH DE number 6155885

    Statements

    Canonical Ground Horn Theories (English)
    0 references
    0 references
    0 references
    19 April 2013
    0 references
    Horn theories
    0 references
    conditional theories
    0 references
    Moore families
    0 references
    decision procedures
    0 references
    canonical systems
    0 references
    normal forms
    0 references
    saturation
    0 references
    redundancy
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers