A hierarchy of tractable satisfiability problems-Reference-Cited by-同舟云学术

A hierarchy of tractable satisfiability problems

Published:1992-12 Issue:4 Volume:44 Page:173-180
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Dalal Mukesh,Etherington David W.

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference8 articles.

1. An O(n2) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all Horn sentences;Arvind;Inform. Process. Lett.,1987

2. H.K. Büning, On generalized Horn formulas and k-resolution, Inform. Process. Lett., to appear.

3. The complexity of theorem proving procedures;Cook;Proc. Third Ann. ACM Symp. on the Theory of Computing,1971

4. Tractable deduction in knowledge representation systems;Dalal;Proc. Third Internat. Conf. on Principles of Knowledge Representation and Reasoning (KR '92),1992

5. Linear-time algorithms for testing the satisfiability of propositional Horn formulae;Dowling;J. Logic Programming,1984

Cited by 29 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Chapter 14. Minimal Unsatisfiability and Autarkies;Frontiers in Artificial Intelligence and Applications;2021-02-02

2. Introducing w-Horn and z-Horn: A generalization of Horn and q-Horn formulae;Annales Mathematicae et Informaticae;2021

3. About some UP-based polynomial fragments of SAT;Annals of Mathematics and Artificial Intelligence;2015-04-08

4. Tractable and intractable classes of propositional schemata;Journal of Logic and Computation;2014-03-14

5. Complexity issues related to propagation completeness;Artificial Intelligence;2013-10