A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Temporal Answer Set Programming on Finite Traces
2018
Theory and Practice of Logic Programming
Preserved Fulltext
AbstractIn this paper, we introduce an alternative approach to Temporal Answer Set Programming that relies on a variation of Temporal Equilibrium Logic (TEL) for finite traces. ...
This approach allows us to even out the expressiveness of TEL over infinite traces with the computational capacity of (incremental) Answer Set Programming (ASP). ...
In Answer Set Programming (ASP; Lifschitz 1999) , this is reflected by temporal extensions of Equilibrium Logic (Aguado et al. 2013) , the host logic of ASP, and action languages (Gelfond and Lifschitz ...
doi:10.1017/s1471068418000297
fatcat:kj7muphaa5gdpo4iodkr3zxtdu
Temporal Modalities in Answer Set Programming (Invited Talk)
2020
International Symposium/Workshop on Temporal Representation and Reasoning
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Based on the answer set (or stable model) semantics for logic programs, Answer Set Programming (ASP) has become one of the most successful paradigms for practical Knowledge Representation and problem solving ...
On the other hand, temporal scenarios also pose a representational challenge, since the basic ASP language does not support temporal expressions. ...
The satisfiability problem in DEL is ExpSpace-complete; it thus coincides with that of TEL but goes beyond that of LDL and LTL, both being PSpace-complete.
2:4 Temporal Modalities in Answer Set Programming ...
doi:10.4230/lipics.time.2020.2
dblp:conf/time/Cabalar20
fatcat:mg7snegse5cv5jgn3k3lnms7re
Automata Techniques for Temporal Answer Set Programming
2021
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2021 pre-print arXiv:2109.08279v1 fatcat:wvorllc7djb4zp5rlguujaywee
Temporal and dynamic extensions of Answer Set Programming (ASP) have played an important role in addressing dynamic problems, as they allow the use of temporal operators to reason with dynamic scenarios ...
One of the main candidates for modeling and solving problems with this type of logic is Answer Set Programming (ASP) [8] . ...
Later on, motivated by how finite traces can better represent the way in which ASP is used to solve problems, the investigation shifted to finite traces with TEL f [14] . ...
doi:10.4204/eptcs.345.42
fatcat:3f37xiiesbda7hhrs74amnebla
Linear-Time Temporal Answer Set Programming
2021
Theory and Practice of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
based on Equilibrium Logic, a well known logical characterization of Answer Set Programming (ASP). ...
We recall the basic definitions for TEL and its monotonic basis, the temporal logic of Here-and-There (THT), and study the differences between finite and infinite trace length. ...
We are especially grateful to David Pearce, whose help and collaboration on Equilibrium Logic was the seed for a great part of the current paper. ...
doi:10.1017/s1471068421000557
fatcat:iwqi332tnbdkdiydjq2cn5ci5a
Temporal Answer Set Programming
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2021 pre-print arXiv:2009.06544v2 fatcat:s4q34xpikzas5phuthpynsqd5aOther Versions
Logic, a well known logical characterization of Answer Set Programming (ASP). ...
We recall the basic definitions for TEL and its monotonic basis, the temporal logic of Here-and-There (THT), and study the differences between infinite and finite traces. ...
of Answer Set Programming, ASP) with Linear-Time Temporal Logic. ...
arXiv:2009.06544v3
fatcat:7oa2hbsndnfzzhpgyfm3movv3e
Temporal Data Model for Program Debugging
2011
International Workshop/Symposium on Database Programming Languages
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present a novel approach to program debugging and dynamic program analysis based on a temporal data model and query language. ...
The point-based query language supports selection, projection, joins, grouping/aggregation, and recursion on both data and temporal attributes. ...
Mechanically traversing an execution trace file is unrealistic: a basic query such as the first one would require traversing the entire trace file which, even for simple programs, can be quite large. ...
dblp:conf/dbpl/LessaJC11
fatcat:nvgzghld2nbq3kfenughmbsd74
Planning with Different Forms of Domain-Dependent Control Knowledge — An Answer Set Programming Approach
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
control knowledge in HTN-planning, GOLOG-programming, and planning with temporal knowledge into ASP. ...
In this paper we present a declarative approach to adding domain-dependent control knowledge for Answer Set Planning (ASP). ...
There are currently more implementations of propositional solvers than of logic programming answer set generators, and the best propositional solvers tend to be faster than the best answer set generators ...
doi:10.1007/3-540-45402-0_17
fatcat:6aizli32zvamrbnpvrlaqxqzza
Statistical Automaton for Verifying Temporal Properties and Computing Information on Traces
2016
International Journal of Computers Communications & Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
this property on execution traces. ...
The goal of this work is to verify temporal properties on industrial applications, with the help of formal dynamic analysis. ...
The last criterion is the way to handle finite traces. Classic models in temporal logic are infinite, while we want to verify properties on finite traces. ...
doi:10.15837/ijccc.2016.5.2148
fatcat:urh7m6ia7neinjzyo5bjhp6t7a
ASP-Based Declarative Process Mining
2022
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
an extension of linear-time temporal logic over finite traces (LTLf). ...
We put forward Answer Set Programming (ASP) as a solution approach for three classical problems in Declarative Process Mining: Log Generation, Query Checking, and Conformance Checking. ...
Answer Set Programming (ASP) An ASP program consists in a set of rules which define predicates and impose relationships among them. ...
doi:10.1609/aaai.v36i5.20493
fatcat:w55o7r5t35acrdzhadhyu56ixy
ASP-Based Declarative Process Mining
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
an extension of linear-time temporal logic over finite traces (LTLf). ...
We put forward Answer Set Programming (ASP) as a solution approach for three classical problems in Declarative Process Mining: Log Generation, Query Checking, and Conformance Checking. ...
Answer Set Programming (ASP) An ASP program consists in a set of rules which define predicates and impose relationships among them. ...
arXiv:2205.01979v1
fatcat:dcteurpxuretzjmjpwnnykobje
Rewriting-Based Techniques for Runtime Verification
2005
Automated Software Engineering : An International Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. ...
First, a simple synthesis algorithm for monitors based on dynamic programming is presented; despite the efficiency of the generated monitors, they unfortunately need to analyze the trace backwards, thus ...
The authors warmly thank the anonymous reviewers for their very detailed and useful comments and suggestions on how to improve this paper. ...
doi:10.1007/s10515-005-6205-y
fatcat:qjtklefxsbcqfpcfpatctavl3a
Page 3189 of Mathematical Reviews Vol. , Issue 98E
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The intended answers are a set of simple first-order formulas, represented as constraint rewrite rules containing only one predicate symbol. ...
Some natural restrictions are imposed on these trees to define a subclass of ordinal trees which can be represented by finite graphs. ...
Domain-Dependent Knowledge in Answer Set Planning
[article]
2005
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
Our approach is declarative and relies on the language of logic programming with answer set semantics (AnsProlog*). AnsProlog* is designed to plan without control knowledge. ...
In this paper we consider three different kinds of domain-dependent control knowledge (temporal, procedural and HTN-based) that are useful in planning. ...
Using rules of this type, one can greatly reduce the number of rules of programs in answer set programming. ...
arXiv:cs/0207023v2
fatcat:qervn3f53vfpjcz7oiz34ptpxi
Domain-dependent knowledge in answer set planning
2006
ACM Transactions on Computational Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our approach is declarative and relies on the language of logic programming with answer set semantics (AnsProlog*). AnsProlog* is designed to plan without control knowledge. ...
In such an approach there is no guarantee that the added rules will reduce the search during answer set computation; although our experimentation shows that it does for large plan lengths. ...
Using rules of this type, one can greatly reduce the number of rules of programs in answer set programming. ...
doi:10.1145/1166109.1166110
fatcat:hfg6lmyvdjappggnp3qtuzsqfe
Domain-dependent knowledge in answer set planning
2006
ACM Transactions on Computational Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our approach is declarative and relies on the language of logic programming with answer set semantics (AnsProlog*). AnsProlog* is designed to plan without control knowledge. ...
In such an approach there is no guarantee that the added rules will reduce the search during answer set computation; although our experimentation shows that it does for large plan lengths. ...
Using rules of this type, one can greatly reduce the number of rules of programs in answer set programming. ...
doi:10.1145/1183278.1183279
fatcat:ishverzobjdfthgsnqojtkzhnq
« Previous
Showing results 1 — 15 out of 25,923 results