Pages that link to "Item:Q3782840"

The following pages link to Unification as a complexity measure for logic programming (Q3782840):

Displaying 33 items.

• A decomposition method for CNF minimality proofs (Q392185) (← links)
• Abstract Hilbertian deductive systems, infon logic, and Datalog (Q393078) (← links)
• Hydras: complexity on general graphs and a subclass of trees (Q507535) (← links)
• A subclass of Horn CNFs optimally compressible in polynomial time (Q693287) (← links)
• A new combination of input and unit deductions for Horn sentences (Q1057665) (← links)
• An \(O(n^ 2)\) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all Horn sentences (Q1097717) (← links)
• Reasoning with minimal models: efficient algorithms and applications (Q1127346) (← links)
• Capturing complexity classes by fragments of second-order logic (Q1193408) (← links)
• The Qu-Prolog unification algorithm: formalisation and correctness (Q1349886) (← links)
• Polynomial-time inference of all valid implications for Horn and related formulae (Q1356205) (← links)
• On computing minimal models (Q1380414) (← links)
• Directed hypergraphs and applications (Q1803674) (← links)
• Sorting, linear time and the satisfiability problem (Q1817067) (← links)
• Unique satisfiability of Horn sets can be solved in nearly linear time (Q1894352) (← links)
• Maximum renamable Horn sub-CNFs (Q1961445) (← links)
• Bidual Horn functions and extensions (Q1961447) (← links)
• The possibilistic Horn non-clausal knowledge bases (Q2105624) (← links)
• An efficient labelled nested multiset unification algorithm (Q2152299) (← links)
• Hardness results for approximate pure Horn CNF formulae minimization (Q2254607) (← links)
• Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing (Q2387427) (← links)
• An incremental algorithm for generating all minimal models (Q2457647) (← links)
• Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
• BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies (Q2818038) (← links)
• Efficient Reasoning for Inconsistent Horn Formulae (Q2835881) (← links)
• Properties of SLUR Formulae (Q2891367) (← links)
• Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing (Q3453236) (← links)
• SAT-Based Horn Least Upper Bounds (Q3453244) (← links)
• (Q3696486) (← links)
• (Q4580325) (← links)
• (Q4598248) (← links)
• Model Checking Games (Q4916199) (← links)
• Selective Unification in (Constraint) Logic Programming* (Q4988929) (← links)
• Hypergraph Horn functions (Q6499011) (← links)