Pages that link to "Item:Q3723723"
From MaRDI portal
The following pages link to Linear-time algorithms for testing the satisfiability of propositional horn formulae (Q3723723):
Displaying 50 items.
- A decomposition method for CNF minimality proofs (Q392185) (← links)
- Abstract Hilbertian deductive systems, infon logic, and Datalog (Q393078) (← links)
- Information-based distance measures and the canonical reflection of view updates (Q429442) (← links)
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Disjunctive closures for knowledge compilation (Q460617) (← links)
- On the tractability of minimal model computation for some CNF theories (Q490649) (← links)
- Directed hypergraphs: introduction and fundamental algorithms -- a survey (Q507517) (← links)
- Succinctness and tractability of closure operator representations (Q507522) (← links)
- Learning definite Horn formulas from closure queries (Q507524) (← links)
- Hydras: complexity on general graphs and a subclass of trees (Q507535) (← links)
- Constraint acquisition (Q511791) (← links)
- About some UP-based polynomial fragments of SAT (Q513329) (← links)
- Decidable containment of recursive queries (Q555766) (← links)
- On the complexity of enumerating pseudo-intents (Q628340) (← links)
- Unique Horn renaming and Unique 2-Satisfiability (Q673674) (← links)
- Skeptical reason maintenance and belief revision (Q685347) (← links)
- On generalized Horn formulas and \(k\)-resolution (Q685363) (← links)
- Complexity of unification problems with associative-commutative operators (Q688565) (← links)
- A subclass of Horn CNFs optimally compressible in polynomial time (Q693287) (← links)
- Complexity of pairwise shortest path routing in the grid (Q703544) (← links)
- A dual algorithm for the satisfiability problem (Q750165) (← links)
- Negation in rule-based database languages: A survey (Q753476) (← links)
- Negation by default and unstratifiable logic programs (Q753501) (← links)
- Algorithms for the maximum satisfiability problem (Q753502) (← links)
- Armstrong axioms and Boyce-Codd-Heath normal form under bag semantics (Q765524) (← links)
- Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models (Q785238) (← links)
- Cyclic consistency: A local reduction operation for binary valued constraints (Q814586) (← links)
- Theory revision with queries: Horn, read-once, and parity formulas (Q814598) (← links)
- Multi-modal diagnosis combining case-based and model-based reasoning: a formal and experimental analysis (Q814620) (← links)
- An NSF proposal (Q815007) (← links)
- Logic programming in tensor spaces (Q825007) (← links)
- Possibilistic uncertainty handling for answer set programming (Q854974) (← links)
- Answer set programming based on propositional satisfiability (Q861709) (← links)
- Dynamic maintenance of directed hypergraphs (Q913481) (← links)
- Existence of simple propositional formulas (Q917333) (← links)
- An efficient automata approach to some problems on context-free grammars. (Q930285) (← links)
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
- Models and quantifier elimination for quantified Horn formulas (Q944709) (← links)
- Incremental classification of description logics ontologies (Q972428) (← links)
- On the relation among answer set solvers (Q1028643) (← links)
- On the complexity of the maximum satisfiability problem for Horn formulas (Q1099168) (← links)
- Fast algorithms for testing unsatisfiability of ground Horn clauses with equations (Q1100933) (← links)
- LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation (Q1111776) (← links)
- Polynomially solvable satisfiability problems (Q1114394) (← links)
- Optimizing propositional calculus formulas with regard to questions of deducibility (Q1117918) (← links)
- Stratification and knowledge base management (Q1122994) (← links)
- Reasoning with minimal models: efficient algorithms and applications (Q1127346) (← links)
- Relevance from an epistemic perspective (Q1127353) (← links)
