Results 1  10
of
11
Logic Programs with Intensional Functions (Preliminary Report
 In: ICLP11 WorkshoponAnswerSetProgrammingandOtherComputingParadigms(ASPOCP11)(Jul 2011
"... The stable model semantics treats a logic program as a mechanism for specifying its intensional predicates. In this paper we discuss a modification of that semantics in which functions, rather than predicates, are intensional. The idea of the new definition comes from nonmonotonic causal logic. ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
The stable model semantics treats a logic program as a mechanism for specifying its intensional predicates. In this paper we discuss a modification of that semantics in which functions, rather than predicates, are intensional. The idea of the new definition comes from nonmonotonic causal logic.
On loop formulas with variables
 In Proceedings of the International Conference on Knowledge Representation and Reasoning (KR
, 2008
"... Recently Ferraris, Lee and Lifschitz proposed a new definition of stable models that does not refer to grounding, which applies to the syntax of arbitrary firstorder sentences. We show its relation to the idea of loop formulas with variables by Chen, Lin, Wang and Zhang, and generalize their loop f ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
Recently Ferraris, Lee and Lifschitz proposed a new definition of stable models that does not refer to grounding, which applies to the syntax of arbitrary firstorder sentences. We show its relation to the idea of loop formulas with variables by Chen, Lin, Wang and Zhang, and generalize their loop formulas to disjunctive programs and to arbitrary firstorder sentences. We also extend the syntax of logic programs to allow explicit quantifiers, and define its semantics as a subclass of the new language of stable models by Ferraris et al. Such programs inherit from the general language the ability to handle nonmonotonic reasoning under the stable model semantics even in the absence of the unique name and the domain closure assumptions, while yielding more succinct loop formulas than the general language due to the restricted syntax. We also show certain syntactic conditions under which query answering for an extended program can be reduced to entailment checking in firstorder logic, providing a way to apply firstorder theorem provers to reasoning about nonHerbrand stable models.
Functional stable model semantics and answer set programming modulo theories
 In Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR
, 2012
"... ”Answer Set Programming Modulo Theories (ASPMT) ” is a recently proposed framework which tightly integrates answer set programming (ASP) and satisfiability modulo theories (SMT). Its mathematical foundation is the functional stable model semantics, an enhancement of the traditional stable model sema ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
”Answer Set Programming Modulo Theories (ASPMT) ” is a recently proposed framework which tightly integrates answer set programming (ASP) and satisfiability modulo theories (SMT). Its mathematical foundation is the functional stable model semantics, an enhancement of the traditional stable model semantics to allow defaults involving functions as well as predicates. This talk will discuss how ASPMT can provide a way to overcome limitations of the propositional setting of ASP, how action language C+ can be reformulated in terms of ASPMT, and how it can be 3 4 Answer Set Programming (ASP) Declarative programming paradigm. Suitable for knowledge intensive
178 Stable Model Semantics and FirstOrder Loop Formulas
 In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI
, 2005
"... Lin and Zhao’s theorem on loop formulas states that in the propositional case the stable model semantics of a logic program can be completely characterized by propositional loop formulas, but this result does not fully carry over to the firstorder case. We investigate the precise relationship betwe ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
Lin and Zhao’s theorem on loop formulas states that in the propositional case the stable model semantics of a logic program can be completely characterized by propositional loop formulas, but this result does not fully carry over to the firstorder case. We investigate the precise relationship between the firstorder stable model semantics and firstorder loop formulas, and study conditions under which the former can be represented by the latter. In order to facilitate the comparison, we extend the definition of a firstorder loop formula which was limited to a nondisjunctive program, to a disjunctive program and to an arbitrary firstorder theory. Based on the studied relationship we extend the syntax of a logic program with explicit quantifiers, which allows us to do reasoning involving nonHerbrand stable models using firstorder reasoners. Such programs can be viewed as a special class of firstorder theories under the stable model semantics, which yields more succinct loop formulas than the general language due to their restricted syntax. 1.
Datalog Programs and Their Stable Models
"... Abstract. This paper is about the functionality of software systems used in answer set programming (ASP). ASP languages are viewed here, in the spirit of Datalog, as mechanisms for characterizing intensional (output) predicates in terms of extensional (input) predicates. Our approach to the semantic ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Abstract. This paper is about the functionality of software systems used in answer set programming (ASP). ASP languages are viewed here, in the spirit of Datalog, as mechanisms for characterizing intensional (output) predicates in terms of extensional (input) predicates. Our approach to the semantics of ASP programs is based on the concept of a stable model defined in terms of a modification of parallel circumscription. 1
Proceedings, Eleventh International Conference on Principles of Knowledge Representation and Reasoning (2008) On Loop Formulas with Variables
"... Recently Ferraris, Lee and Lifschitz proposed a new definition of stable models that does not refer to grounding, which applies to the syntax of arbitrary firstorder sentences. We show its relation to the idea of loop formulas with variables by Chen, Lin, Wang and Zhang, and generalize their loop f ..."
Abstract
 Add to MetaCart
(Show Context)
Recently Ferraris, Lee and Lifschitz proposed a new definition of stable models that does not refer to grounding, which applies to the syntax of arbitrary firstorder sentences. We show its relation to the idea of loop formulas with variables by Chen, Lin, Wang and Zhang, and generalize their loop formulas to disjunctive programs and to arbitrary firstorder sentences. We also extend the syntax of logic programs to allow explicit quantifiers, and define its semantics as a subclass of the new language of stable models by Ferraris et al. Such programs inherit from the general language the ability to handle nonmonotonic reasoning under the stable model semantics even in the absence of the unique name and the domain closure assumptions, while yielding more succinct loop formulas than the general language due to the restricted syntax. We also show certain syntactic conditions under which query answering for an extended program can be reduced to entailment checking in firstorder logic, providing a way to apply firstorder theorem provers to reasoning about nonHerbrand stable models.
Under consideration for publication in Theory and Practice of Logic Programming 1 Relational Theories with Null Values and NonHerbrand Stable Models
, 2003
"... Generalized relational theories with null values in the sense of Reiter are firstorder theories that provide a semantics for relational databases with incomplete information. In this paper we show that any such theory can be turned into an equivalent logic program, so that models of the theory can ..."
Abstract
 Add to MetaCart
(Show Context)
Generalized relational theories with null values in the sense of Reiter are firstorder theories that provide a semantics for relational databases with incomplete information. In this paper we show that any such theory can be turned into an equivalent logic program, so that models of the theory can be generated using computational methods of answer set programming. As a step towards this goal, we develop a general method for calculating stable models under the domain closure assumption but without the unique name assumption. 1
Under consideration for publication in Theory and Practice of Logic Programming 1 On the Stable Model Semantics for Intensional Functions
, 2013
"... Several extensions of the stable model semantics are available to describe “intensional ” functions—functions that can be described in terms of other functions and predicates by logic programs. Such functions are useful for expressing inertia and default behaviors of systems, and can be exploited fo ..."
Abstract
 Add to MetaCart
Several extensions of the stable model semantics are available to describe “intensional ” functions—functions that can be described in terms of other functions and predicates by logic programs. Such functions are useful for expressing inertia and default behaviors of systems, and can be exploited for alleviating the grounding bottleneck involving functional fluents. However, the extensions were defined in different ways under different intuitions. In this paper we provide several reformulations of the extensions, and note that they are in fact closely related to each other and coincide on large syntactic classes of logic programs.
Proceedings of the TwentyThird International Joint Conference on Artificial Intelligence Functional Stable Model Semantics and Answer Set Programming Modulo Theories
"... Recently there has been an increasing interest in incorporating “intensional ” functions in answer set programming. Intensional functions are those whose values can be described by other functions and predicates, rather than being predefined as in the standard answer set programming. We demonstrate ..."
Abstract
 Add to MetaCart
Recently there has been an increasing interest in incorporating “intensional ” functions in answer set programming. Intensional functions are those whose values can be described by other functions and predicates, rather than being predefined as in the standard answer set programming. We demonstrate that the functional stable model semantics plays an important role in the framework of “Answer Set Programming Modulo Theories (ASPMT) ” —a tight integration of answer set programming and satisfiability modulo theories, under which existing integration approaches can be viewed as special cases where the role of functions is limited. We show that “tight ” ASPMT programs can be translated into SMT instances, which is similar to the known relationship between ASP and SAT. 1
Relational Theories with Null Values and NonHerbrand Stable Models
"... Generalized relational theories with null values in the sense of Reiter are firstorder theories that provide a semantics for relational databases with incomplete information. In this paper we show that any such theory can be turned into an equivalent logic program, so that models of the theory can ..."
Abstract
 Add to MetaCart
Generalized relational theories with null values in the sense of Reiter are firstorder theories that provide a semantics for relational databases with incomplete information. In this paper we show that any such theory can be turned into an equivalent logic program, so that models of the theory can be generated using computational methods of answer set programming. As a step towards this goal, we develop a general method for calculating stable models under the domain closure assumption but without the unique name assumption. 1