In this paper we present STeLP, a solver for Answer Set programming with temporal operators. Taking as an input a particular kind of logic program with modal operators (called Splitable Temporal logic Program), STeLP ...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
In this paper we present STeLP, a solver for Answer Set programming with temporal operators. Taking as an input a particular kind of logic program with modal operators (called Splitable Temporal logic Program), STeLP obtains its set of temporal equilibrium models (a generalisation of stable models for this extended syntax). the obtained set of models is represented in terms of a deterministic Buchi automaton capturing the complete program behaviour. In small examples, this automaton can be graphically displayed in a direct and readable way. the input language provides a set of constructs which allow a simple definition of temporal logic programs, including a special syntax for action domains that can be exploited to simplify the graphical output. STeLP combines the use of a standard ASP solver with a linear temporal logic model checker in order to find all models of the input theory.
the event calculus is a logic-based formalism for dealing with temporal reasoning concerns. Erlang is a functional programming language designed from the ground up for tackling distributed programming problems. In thi...
详细信息
In this paper, we study a method for computing temporal equilibrium models, a generalisation of stable models for logic programs with temporal operators, as in Linear Temporal logic (LTL). To this aim, we focus on a s...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
In this paper, we study a method for computing temporal equilibrium models, a generalisation of stable models for logic programs with temporal operators, as in Linear Temporal logic (LTL). To this aim, we focus on a syntactic subclass of these temporal logic programs called splitable and whose main property is satisfying a kind of "future projected" dependence present in most dynamic scenarios in Answer Set programming (ASP). Informally speaking, this property can be expressed as "past does not depend on the future." We show that for this syntactic class, temporal equilibrium models can be captured by an LTL formula, that results from the combination of two well-known techniques in ASP: splitting and loop formulas. As a result, an LTL model checker can be used to obtain the temporal equilibrium models of the program.
Temporal logics and their intuitionistic counterparts are of growing importance in Computer Science. these intuitionistic counterparts, called intuitionistic (or constructive) temporal logics, are known to be useful f...
详细信息
ISBN:
(纸本)9783642238628
Temporal logics and their intuitionistic counterparts are of growing importance in Computer Science. these intuitionistic counterparts, called intuitionistic (or constructive) temporal logics, are known to be useful for formalizing functional programming. To show a clear relationship between temporal logics and their intuitionistic counterparts has thus been required. In this paper, a theorem for embedding first-order linear-time temporal logic into its intuitionistic counterpart is proved using Baratella-Masini's temporal extension of the Godel-Gentzen negative translation of classical logic into intuitionistic logic.
Probabilistic programming promises to make probabilistic modeling easier by making it possible to create models using the power of programming languages, and by applying general-purpose algorithms to reason about mode...
详细信息
ISBN:
(纸本)9783642212949;9783642212956
Probabilistic programming promises to make probabilistic modeling easier by making it possible to create models using the power of programming languages, and by applying general-purpose algorithms to reason about models. We present a new probabilistic programming language named Figaro that was designed with practicality and usability in mind. Figaro can represent models naturally that have been difficult to represent in other languages, such as probabilistic relational models and models with undirected relationships with arbitrary constraints. An important feature is that the Figaro language and reasoning algorithms are embedded as a library in Scala. We illustrate the use of Figaro through a case study.
the paper addresses the problem of searching relevant learning resources in social networks, shared between members, therefore, a network of shared leaning resources is build up. We propose a distributed description l...
详细信息
ISBN:
(纸本)9783642218682;9783642218699
the paper addresses the problem of searching relevant learning resources in social networks, shared between members, therefore, a network of shared leaning resources is build up. We propose a distributed description logics based semantic model to share learning resources. Using the logics allows to infering additional interesting relatioships between learning resources that are not expressed by members. Moreover we provide a distributed reasoning algorithm that allows searching of all relevant learning resources in the social network.
Heterogeneous nonmonotonic multi-context systems (MCS) permit different logics to be used in different contexts, and link them via bridge rules. We investigate the role of symmetry detection and symmetry breaking in s...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
Heterogeneous nonmonotonic multi-context systems (MCS) permit different logics to be used in different contexts, and link them via bridge rules. We investigate the role of symmetry detection and symmetry breaking in such systems to eliminate symmetric parts of the search space and, thereby, simplify the evaluation process. We propose a distributed algorithm that takes a local stance, i.e., computes independently the partial symmetries of a context and, in order to construct potential symmetries of the whole, combines them withthose partial symmetries returned by neighbouring contexts. We prove the correctness of our methods. We instantiate such symmetry detection and symmetry breaking in a multi-context system with contexts that use answer set programs, and demonstrate computational benefit on some recently proposed benchmarks.
this paper presents a compilation scheme, called ASP2AR, for translating ASP into event-driven action rules. For an ASP program, the generated program maintains a partial answer set as a pair of sets of tuples (called...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
this paper presents a compilation scheme, called ASP2AR, for translating ASP into event-driven action rules. For an ASP program, the generated program maintains a partial answer set as a pair of sets of tuples (called IN and OUT) and propagates updates to these sets using action rules. To facilitate propagation, we encode each set as a finite-domain variable and treat additions of tuples into a set as events handled by action rules. Like GASP and ASPeRiX, ASP2AR requires no prior grounding of programs. the preliminary experimental results show that ASP2AR is an order of magnitude faster than GASP and is much faster than Clasp on benchmarks that require heavy grounding.
We introduce a framework for interactive stepping through an answer-set program as a means for debugging. In procedural languages, stepping is a widespread and effective debugging strategy. the idea is to gain insight...
详细信息
ISBN:
(纸本)9783642208942
We introduce a framework for interactive stepping through an answer-set program as a means for debugging. In procedural languages, stepping is a widespread and effective debugging strategy. the idea is to gain insight into the behaviour of a program by executing statement by statement, following the program's control flow. Stepping has not been considered for answer-set programs so far, presumably because of their lack of a control flow. the framework we provide allows for stepwise constructing interpretations following the user's intuition on which rule instances to become active. that is, we do not impose any ordering on the rules but give the programmer the freedom to guide the stepping process. Due to simple syntactic restrictions, each step results in a state that guarantees stability of the intermediate interpretation. We present how stepping can be started from breakpoints as in conventional programming and discuss how the approach can be used for debugging using a running example.
Disjunctive logicprogramming (DLP) is an extension of Datalog that allows for disjunction in rule head and nonmonotonic negation in bodies. All of the queries in the second level of the polynomial hierarchy can be ex...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
Disjunctive logicprogramming (DLP) is an extension of Datalog that allows for disjunction in rule head and nonmonotonic negation in bodies. All of the queries in the second level of the polynomial hierarchy can be expressed in this language. However, DLP does not allow for representing properties which involve sets of data in a natural way. Extending the language by introducing aggregate functions has been proposed in the literature to overcome this lack, then leading to the language DLPA,(sic). In particular, DLPA,(sic) allows for using recursive aggregates, which naturally arise in many practical application scenarios. An aggregate is recursive if its aggregate set depends on the evaluation of the aggregate itself. the evaluation of programs with aggregates is hard, especially when aggregates are recursive, optimization techniques are highly needed to make these programs usable in real-world applications. In this paper, we focus on the optimization of queries over programs with recursive aggregates. In particular, we design an extension of the Dynamic Magic Set (DMS) technique to programs with stratified negation and monotone recursive aggregates, and we demonstrate the correctness of the proposed technique. For assessing the effectiveness of the new technique, we consider a standard benchmark for recursive aggregates, referred to as Company Controls, along with a couple of benchmarks involving aggregates over the WordNet database. Experimental results confirm the effectiveness of our technique.
暂无评论