Programming with non-determinism in deductive databases

Author： Giannotti F. Greco S. Saccà D. Zaniolo C.

ISSN： 1012-2443

Source： Annals of Mathematics and Artificial Intelligence, Vol.19, Iss.1-2, 1997-01, pp. : 97-125

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On non-determinism in machines and languages

By Grumbach S. Lacroix Z.

Annals of Mathematics and Artificial Intelligence, Vol. 19, Iss. 1-2, 1997-01 ,pp. : 169-213

Springer Publishing Company

Access to resources Recommend Favorite

Using clausal deductive databases for defining semantics in disjunctive deductive databases

By Seipel D.

Annals of Mathematics and Artificial Intelligence, Vol. 33, Iss. 2-4, 2001-12 ,pp. : 347-378

Springer Publishing Company

Access to resources Recommend Favorite

Applying restriction constraints to deductive databases

By Aquilino D. Asirelli P. Renso C. Turini F.

Annals of Mathematics and Artificial Intelligence, Vol. 19, Iss. 1-2, 1997-01 ,pp. : 3-25

Springer Publishing Company

Access to resources Recommend Favorite

On the partial semantics for disjunctive deductive databases

By Eiter T. Saccà D. Leone N. Saccà D.

Annals of Mathematics and Artificial Intelligence, Vol. 19, Iss. 1-2, 1997-01 ,pp. : 59-96

Springer Publishing Company

Access to resources Recommend Favorite

Tabling for non-monotonic programming

By Swift T.

Annals of Mathematics and Artificial Intelligence, Vol. 25, Iss. 3-4, 1999-01 ,pp. : 201-240

Springer Publishing Company

Access to resources Recommend Favorite