Finite representation of infinite query answers

We define here a formal notion of finite representation of infinite query answers in logic programs. We apply this notion to DatalognS programs may be infinite and consequently queries may have infinite answers. We present a method to finitely represent infinite least Herbrand models of DatalognS pr...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	ACM transactions on database systems 1993-06, Vol.18 (2), p.181-223
Hauptverfasser:	Chomicki, Jan, Imieliński, Tomasz
Format:	Artikel
Sprache:	eng
Schlagworte:	990200 - Mathematics & Computers Applied sciences Artificial intelligence Computability Computer science control theory systems Computing methodologies DATA BASE MANAGEMENT Data management systems DATA PROCESSING Database query languages (principles) Database theory Design and analysis of algorithms Exact sciences and technology GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE INFORMATION RETRIEVAL Information systems Information systems. Data bases Knowledge representation and reasoning Logic Machine learning Machine learning approaches MANAGEMENT Memory organisation. Data processing Models of computation PROCESSING Query languages Rule learning Software TASK SCHEDULING Theory and algorithms for application domains Theory of computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!