Ordered completion for logic programs with aggregates

Artificial Intelligence 224 (C):72-102 (2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

First-order theories for pure Prolog programs with negation.Robert F. Stärk - 1995 - Archive for Mathematical Logic 34 (2):113-144.
Completions of Convexly Ordered Valuation Rings.Larry Mathews - 1994 - Mathematical Logic Quarterly 40 (3):318-330.
D -completions and the d -topology.Klaus Keimel & Jimmie D. Lawson - 2009 - Annals of Pure and Applied Logic 159 (3):292-306.
The Model Completion of the Theory of All Partially Ordered Sets.G. E. Puninskij - 1989 - Mathematical Logic Quarterly 35 (6):481-481.
On Definitions of Cuts and Completion of Partially Ordered Sets.Alexander Abian - 1968 - Mathematical Logic Quarterly 14 (19):299-302.
Elimination of algorithmic quantifiers for ordered differential algebra.Yunfu Shen - 1999 - Archive for Mathematical Logic 38 (3):139-144.
An alternative linear semantics for allowed logic programs.John Jeavons - 1997 - Annals of Pure and Applied Logic 84 (1):3-16.
Hierarchies of Partially Ordered Connectives and Quantifiers.Michał Krynicki - 1993 - Mathematical Logic Quarterly 39 (1):287-294.
Advances in the theory of μŁΠ algebras.Enrico Marchioni & Luca Spada - 2011 - Logic Journal of the IGPL 19 (3):476-489.

Analytics

Added to PP
2020-12-22

Downloads
11 (#976,244)

6 months
6 (#203,358)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Yan Zhang
Hong Kong Baptist University