On-line algorithms for polynomially solvable satisfiability problems
- 31 January 1991
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 10 (1) , 69-90
- https://doi.org/10.1016/0743-1066(91)90006-b
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Unification as a complexity measure for logic programmingThe Journal of Logic Programming, 1987
- An O(n2) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all horn sentencesInformation Processing Letters, 1987
- Amortized efficiency of a path retrieval data structureTheoretical Computer Science, 1986
- Minimal Representation of Directed HypergraphsSIAM Journal on Computing, 1986
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- Amortized Computational ComplexitySIAM Journal on Algebraic Discrete Methods, 1985
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- Graph Algorithms for Functional Dependency ManipulationJournal of the ACM, 1983
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- An On-Line Edge-Deletion ProblemJournal of the ACM, 1981