LINEAR-TIME ALGORITHMS FOR TESTING THE SATISFIABILITY OF PROPOSITIONAL HORN FORMULAE.

被引：523

作者：

Dowling, William F.

Gallier, Jean H.

机构：

来源：

Journal of Logic Programming | 1984年 / 1卷 / 03期

关键词：

D O I：

10.1016/0743-1066(84)90014-1

中图分类号：

学科分类号：

摘要：

引用

页码：267 / 284

共 50 条

[1] A LINEAR-TIME ALGORITHM FOR UNIQUE HORN SATISFIABILITY
PRETOLANI, D
INFORMATION PROCESSING LETTERS, 1993, 48 (02) : 61 - 66
[2] THE COMPUTATIONAL-COMPLEXITY OF SATISFIABILITY OF TEMPORAL HORN FORMULAS IN PROPOSITIONAL LINEAR-TIME TEMPORAL LOGIC
CHEN, CC
LIN, IP
INFORMATION PROCESSING LETTERS, 1993, 45 (03) : 131 - 136
[3] ALGORITHMS FOR TESTING THE SATISFIABILITY OF PROPOSITIONAL FORMULAS
GALLO, G
URBANI, G
JOURNAL OF LOGIC PROGRAMMING, 1989, 7 (01): : 45 - 61
[4] UNIQUE SATISFIABILITY OF HORN SETS CAN BE SOLVED IN NEARLY LINEAR-TIME
BERMAN, KA
FRANCO, J
SCHLIPF, JS
DISCRETE APPLIED MATHEMATICS, 1995, 60 (1-3) : 77 - 91
[5] Linear-time algorithms for testing the realisability of line drawings of curved objects
Cooper, Martin C.
Artificial Intelligence, 1999, 108 (01): : 31 - 67
[6] Linear-time algorithms for testing the realisability of line drawings of curved objects
Cooper, MC
ARTIFICIAL INTELLIGENCE, 1999, 108 (1-2) : 31 - 67
[7] LINEAR-TIME ALGORITHMS IN MEMORY HIERARCHIES
REGAN, KW
INFORMATION PROCESSING '94, VOL I: TECHNOLOGY AND FOUNDATIONS, 1994, 51 : 288 - 293
[8] An efficient linear-time clustering algorithms
Wang, L
Zang, LJ
Song, RF
Proceedings of the 11th Joint International Computer Conference, 2005, : 678 - 681
[9] Linear-Time Algorithms for Proportional Apportionment
Cheng, Zhanpeng
Eppstein, David
ALGORITHMS AND COMPUTATION, ISAAC 2014, 2014, 8889 : 581 - 592
[10] RUNNING TIME EXPERIMENTS ON SOME ALGORITHMS FOR SOLVING PROPOSITIONAL SATISFIABILITY PROBLEMS
MAYER, J
MITTERREITER, I
RADERMACHER, FJ
ANNALS OF OPERATIONS RESEARCH, 1995, 55 : 139 - 178

← 1 2 3 4 5 →