Pages that link to "Item:Q1111776"
From MaRDI portal
The following pages link to LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation (Q1111776):
Displaying 38 items.
- Ltur (Q23629) (← links)
- 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)
- About some UP-based polynomial fragments of SAT (Q513329) (← links)
- A subclass of Horn CNFs optimally compressible in polynomial time (Q693287) (← links)
- Satisfiability of mixed Horn formulas (Q997066) (← links)
- Efficient inclusion checking for deterministic tree automata and XML schemas (Q1041037) (← links)
- Horn functions and their DNFs (Q1195858) (← links)
- On the complexity of propositional knowledge base revision, updates, and counterfactuals (Q1199919) (← links)
- The unique Horn-satisfiability problem and quadratic Boolean equations. (Q1353999) (← links)
- Polynomial-time inference of all valid implications for Horn and related formulae (Q1356205) (← links)
- Branch-and-cut solution of inference problems in propositional logic (Q1356213) (← links)
- Semantics and complexity of abduction from default theories (Q1402749) (← links)
- A variant of Reiter's hitting-set algorithm (Q1603435) (← links)
- On functional dependencies in \(q\)-Horn theories (Q1606330) (← links)
- Recognizing renamable generalized propositional Horn formulas is NP- complete (Q1804878) (← links)
- Sorting, linear time and the satisfiability problem (Q1817067) (← links)
- Recognition and dualization of disguised bidual Horn functions. (Q1853017) (← links)
- Unique satisfiability of Horn sets can be solved in nearly linear time (Q1894352) (← links)
- Copy complexity of Horn formulas with respect to unit read-once resolution (Q2235734) (← links)
- Hardness results for approximate pure Horn CNF formulae minimization (Q2254607) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- From simplification to a partial theory solver for non-linear real polynomial constraints (Q2307623) (← links)
- Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing (Q2387427) (← links)
- Maintenance goals of agents in a dynamic environment: formulation and policy construction (Q2389664) (← links)
- Generalized domination in closure systems (Q2489652) (← links)
- Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems (Q2641226) (← 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)
- A CNF Class Generalizing Exact Linear Formulas (Q3502711) (← links)
- TRANSITIVE PRIMAL INFON LOGIC (Q4928774) (← links)
- On Tackling Explanation Redundancy in Decision Trees (Q5041018) (← links)
- Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR (Q5302727) (← links)
- Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data (Q5738985) (← links)
