Stijn Heymans, Davy Van Nieuwenborgh, and Dirk Vermeir Dept. of Computer...  Home/Search
Context
Related
| tinf2.vub.ac.be/~dverme...lpnmr2005.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: tinf2.vub.ac.be/~dvermeir...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program's constants. We define a fixed point logic (FPL) extension of Clark's completion such that open answer sets correspond to models of FPL formulas and identify a syntactic subclass of programs, called (loosely) guarded programs. (Update)
Active bibliography (related documents): More All
0.5: Nonmonotonic Ontological and Rule-Based Reasoning.. - Heymans, Van.. (2005) (Correct)
0.3: Towards Automated Integration of Guess and Check . . . - Eiter (2004) (Correct)
0.2: Weighted Answer Sets and Applications in Intelligence.. - Van Nieuwenborgh.. (2004) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ davy-guarded,
author = "Stijn Heymans Davy",
title = "Guarded Open Answer Set Programming",
url = "citeseer.ist.psu.edu/738010.html" }
Citations (may not include all citations):858 The Stable Model Semantics for Logic Programming - Gelfond, Lifschitz - 1988
775 Foundations of Databases (context) - Abiteboul, Hull et al. - 1995
759 Negation as Failure (context) - Clark - 1987
190 Results on the Propositional -calculus (context) - Kozen - 1983
119 Using Branching Time Temporal Logic to Synthesize Synchroniz.. (context) - Emerson, Clarke - 1982
75 Complexity and Expressive Power of Logic Programming - Dantsin, Eiter et al. - 2001
40 Modal Languages and Bounded Fragments of Predicate Logic (context) - Andreka, Nemeti et al. - 1998
32 Pushing Goal Derivation in DLP Computations - Faber, Leone et al. - 1999
26 ACM Transactions on Computational Logic (context) - Lifschitz, Pearce et al. - 2001
25 ASSAT: Computing Answer Sets of a Logic Program by SAT Solve.. (context) - Lin, Zhao - 2002
21 Reasoning and Declarative Problem Solving (context) - Baral - 2003
18 the Restraining Power of Guards (context) - Gradel - 1999
18 Guarded Fixed Point Logic - Gradel, Walukiewicz - 1999
9 Datalog LITE: A deductive query language with linear time mo.. - Gottlob, Gradel et al. - 2002
8 Horn Clauses and the Fixpoint Query Hierarchy (context) - Chandra, Harel - 1982
8 Reasoning in Open Domains - Gelfond, Przymusinska - 1993
5 The SMODELS System (context) - Syrjanen, Niemela - 2001
5 Loop Formulas for Disjunctive Logic Programs - Lee, Lifschitz - 2003
2 Semantic Web Reasoning with Conceptual Logic Programs - Heymans, Van Nieuwenborgh et al. - 2004
1 Nonmonotonic Ontological and RuleBased Reasoning with Extend.. - Heymans, Van Nieuwenborgh et al. - 2005
1 Omega-restricted Logic Programs (context) - Syrjanen - 2001
1 Dynamic Bits and Pieces (context) - Van Benthem - 1997
http://tinf2.vub.ac.be/sheymans/tech/guarded-oasp.ps.gz
Documents on the same site (http://tinf2.vub.ac.be/~dvermeir/papers/index.html): More
Robust Semantics for Argumentation Frameworks - Jakobovits, Vermeir (1999) (Correct)
Dialectic Semantics for Argumentation Frameworks - Jakobovits, Vermeir (1999) (Correct)
Choice logic programs and Nash equilibria in strategic games - De Vos, Vermeir (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC