Ordered completion for first-order logic programs on finite structures

, , &
Artificial Intelligence 177-179 (C):1-24 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2011.11.001

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,164

External links

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

Through your library

My notes

Similar books and articles

Ordered completion for logic programs with aggregates.Vernon Asuncion, Yin Chen, Yan Zhang & Yi Zhou - 2015 - Artificial Intelligence 224 (C):72-102.
On linearly ordered structures of finite rank.Alf Onshuus & Charles Steinhorn - 2009 - Journal of Mathematical Logic 9 (2):201-239.
Join-completions of partially ordered algebras.José Gil-Férez, Luca Spada, Constantine Tsinakis & Hongjun Zhou - 2020 - Annals of Pure and Applied Logic 171 (10):102842.
Complexity and expressive power of second‐order extended Horn logic.Shiguang Feng & Xishun Zhao - 2013 - Mathematical Logic Quarterly 59 (1-2):4-11.
The logic of informational independence and finite models.G. Sandu - 1997 - Logic Journal of the IGPL 5 (1):79-95.
Epsilon-logic is more expressive than first-order logic over finite structures.Martin Otto - 2000 - Journal of Symbolic Logic 65 (4):1749-1757.
Epsilon-Logic Is More Expressive Than First-Order Logic over Finite Structures.Martin Otto - 2000 - Journal of Symbolic Logic 65 (4):1749-1757.
On dp-minimal ordered structures.Pierre Simon - 2011 - Journal of Symbolic Logic 76 (2):448 - 460.
First-order theories for pure Prolog programs with negation.Robert F. Stärk - 1995 - Archive for Mathematical Logic 34 (2):113-144.
On second-order generalized quantifiers and finite structures.Anders Andersson - 2002 - Annals of Pure and Applied Logic 115 (1--3):1--32.
Two Variable First-Order Logic Over Ordered Domains.Martin Otto - 2001 - Journal of Symbolic Logic 66 (2):685-702.
Two variable first-order logic over ordered domains.Martin Otto - 2001 - Journal of Symbolic Logic 66 (2):685-702.
Algebraic aspects of cut elimination.Francesco Belardinelli, Peter Jipsen & Hiroakira Ono - 2004 - Studia Logica 77 (2):209 - 240.
Relativized logspace and generalized quantifiers over finite ordered structures.Georg Gottlob - 1997 - Journal of Symbolic Logic 62 (2):545-574.
On finite rigid structures.Yuri Gurevich & Saharon Shelah - 1996 - Journal of Symbolic Logic 61 (2):549-562.

Analytics

Added to PP
2020-12-22

Downloads
10 (#1,118,334)

6 months
4 (#657,928)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Yan Zhang
Hong Kong Baptist University
Yi Zhou

Citations of this work

A progression semantics for first-order logic programs.Yi Zhou & Yan Zhang - 2017 - Artificial Intelligence 250 (C):58-79.

Add more citations

References found in this work

Stable models and circumscription.Paolo Ferraris, Joohyung Lee & Vladimir Lifschitz - 2011 - Artificial Intelligence 175 (1):236-263.

Add more references