SolrQueryCompletionProxy
QueryCompletionProxy
 
     
Zurück zur Trefferliste

Loop checking and negation

B3Kat (1/1)


Loop checking and negation

Verfasser: Bol, Roland N.

 Buch
SFX (Services, Fernleihe und weitere eXtras)

Bestand im BVB:
Dieser Titel ist Teil einer Serie/Reihe:

Letzte Änderung: 06.02.1994
Titel:Loop checking and negation
Von:R. N. Bol
Erscheinungsort:Amsterdam
Erscheinungsjahr:1990
Umfang:32 S.
Serie/Reihe:Centrum voor Wiskunde en Informatica<Amsterdam>/ Department of Computer Science: Report CS
Band:90,75
ID der Serie/Reihe:(DE-604)BV008928356
Abstract:Abstract: "In this article we extend the concept of loop checking from positive programs (as described in [ABK]) to locally stratified programs. Such an extension is not straightforward: the introduction of negation requires a (re)consideration of the choice of semantics, the description of a related search space and new soundness and completeness results handling floundering in a satisfactory way. Nevertheless an extension is achieved that allows us to generalize the loop checking mechanisms from positive programs to locally stratified programs, while preserving most soundness and completenessresults. The conclusion is that negative literals cannot give rise to loops, and must be simply ignored."
Sprache:eng
Weitere Schlagwörter :Deductive databases; Logic programming; Loops (Group theory); Negation (Logic)

MARC-Felder:
LEADER00000nam a2200000 cb4500
001BV008974423
003DE-604
007t
008940206s1990             |||| 00||| eng d
035 |a (OCoLC)24924096 
035 |a (DE-599)BVBBV008974423 
040 |a DE-604 |b ger |e rakddb 
0410 |a eng 
049 |a DE-29T |a DE-91G 
1001 |a Bol, Roland N. |e Verfasser |4 aut 
24510|a Loop checking and negation |c R. N. Bol 
264 1|a Amsterdam |c 1990 
300 |a 32 S. 
336 |b txt |2 rdacontent 
337 |b n |2 rdamedia 
338 |b nc |2 rdacarrier 
4901 |a Centrum voor Wiskunde en Informatica<Amsterdam>/ Department of Computer Science: Report CS |v 90,75 
5203 |a Abstract: "In this article we extend the concept of loop checking from positive programs (as described in [ABK]) to locally stratified programs. Such an extension is not straightforward: the introduction of negation requires a (re)consideration of the choice of semantics, the description of a related search space and new soundness and completeness results handling floundering in a satisfactory way. Nevertheless an extension is achieved that allows us to generalize the loop checking mechanisms from positive programs to locally stratified programs, while preserving most soundness and completenessresults. The conclusion is that negative literals cannot give rise to loops, and must be simply ignored." 
650 4|a Deductive databases 
650 4|a Logic programming 
650 4|a Loops (Group theory) 
650 4|a Negation (Logic) 
830 0|a Centrum voor Wiskunde en Informatica<Amsterdam>/ Department of Computer Science: Report CS |v 90,75 |w (DE-604)BV008928356 
999 |a oai:aleph.bib-bvb.de:BVB01-005925997