Skip to main content
×
Home
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 3
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Zhao, Zhili Paschke, Adrian and Zhang, Ruisheng 2016. A rule-based agent-oriented approach for supporting weakly-structured scientific workflows. Web Semantics: Science, Services and Agents on the World Wide Web, Vol. 37-38, p. 36.


    Riguzzi, Fabrizio and Swift, Terrance 2014. Terminating Evaluation of Logic Programs with Finite Three-Valued Models. ACM Transactions on Computational Logic, Vol. 15, Issue. 4, p. 1.


    Baroni, Pietro Cerutti, Federico Dunne, Paul E. and Giacomin, Massimiliano 2013. Automata for infinite argumentation structures. Artificial Intelligence, Vol. 203, p. 104.


    ×

A decidable subclass of finitary programs

  • SABRINA BASELICE (a1) and PIERO A. BONATTI (a1)
  • DOI: http://dx.doi.org/10.1017/S1471068410000232
  • Published online: 01 July 2010
Abstract
Abstract

Answer set programming—the most popular problem solving paradigm based on logic programs—has been recently extended to support uninterpreted function symbols (Syrjänen 2001, Bonatti 2004; Simkus and Eiter 2007; Gebser et al. 2007; Baselice et al. 2009; Calimeri et al. 2008). All of these approaches have some limitation. In this paper we propose a class of programs called FP2 that enjoys a different trade-off between expressiveness and complexity. FP2 is inspired by the extension of finitary normal programs with local variables introduced in (Bonatti 2004, Section 5). FP2 programs enjoy the following unique combination of properties: (i) the ability of expressing predicates with infinite extensions; (ii) full support for predicates with arbitrary arity; (iii) decidability of FP2 membership checking; (iv) decidability of skeptical and credulous stable model reasoning for call-safe queries. Odd cycles are supported by composing FP2 programs with argument restricted programs.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

S. Baselice , P. A. Bonatti , and G. Criscuolo 2009. On finitely recursive programs. Theory and Practice of Logic Programming 9, 2, 213238.

P. A. Bonatti 2004. Reasoning with infinite stable models. Artificial Intelligence 156, 1, 75111.

P. A. Bonatti 2008. Erratum to: Reasoning with infinite stable models [Artificial Intelligence 156 (1) (2004) 75–111]. Artificial Intelligence 172, 15, 18331835.

A. Bossi , N. Cocco , and M. Fabris 1994. Norms on terms and their use in proving universal termination of a logic program. Theoretical Computer Science 124, 2, 297328.

M. Gelfond and V. Lifschitz 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 3–4, 365386.

J. W. Lloyd 1984. Foundations of Logic Programming, 1st ed.Springer.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Theory and Practice of Logic Programming
  • ISSN: 1471-0684
  • EISSN: 1475-3081
  • URL: /core/journals/theory-and-practice-of-logic-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords: