Name
Abstract | ||
|---|---|---|
. We address methods of speeding up the calculation of thewell-founded semantics for normal propositional logic programs. We firstconsider two algorithms already reported in the literature and show thatthese, plus a variation upon them, have much improved worst-case behaviorfor special cases of input. Then we propose a general algorithmto speed up the calculation for logic programs with at most two positivesubgoals per clause, intended to improve the worst case performance ofthe... |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1007/3-540-59487-6_9 | LPNMR |
Keywords | Field | DocType |
computing well-founded semantics faster,structured programming,mathematical logic,semantics,algorithms,data bases,computations,optimization,propositional logic | Computational logic,Autoepistemic logic,Horn clause,Computer science,Algorithm,Multimodal logic,Zeroth-order logic,Theoretical computer science,Resolution (logic),Intermediate logic,Higher-order logic | Conference |
Volume | ISSN | ISBN |
928 | 0302-9743 | 3-540-59487-6 |
Citations | PageRank | References |
13 | 2.29 | 13 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kenneth A. Berman | 1 | 97 | 24.17 |
| John S. Schlipf | 2 | 1697 | 247.21 |
| John V. Franco | 3 | 106 | 13.84 |
| KA Berman | 4 | 13 | 2.29 |
| JS Schlipf | 5 | 13 | 2.29 |
| JV Franco | 6 | 13 | 2.29 |