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.
Filters
A Brief History of Updates of Answer-Set Programs
[article]
2022
arXiv
pre-print
Preserved Fulltext
Other Versions
Over the last couple of decades, there has been a considerable effort devoted to the problem of updating logic programs under the stable model semantics (a.k.a. answer-set programs) or, in other words, ...
In this paper, we will overview some of the main approaches and results related to answer-set programming updates, while pointing out some of the main challenges that research in this topic has faced. ...
Przymusinski, and Theresa Swift, with whom they worked on the topic of this paper over the years, as well as Ricardo Gonc ¸alves and Matthias Knorr for valuable comments on an earlier draft of this paper ...
arXiv:2112.13477v2
fatcat:ketwl6uunreozctkubxwxahvki
A Generalised Semantics for Belief Updates - An Equivalence-based Approach
2013
Ciencias Huasteca Boletín Científico de la Escuela Superior de Huejutla
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.
Set Programming (ASP) que requiere de bases teóricas sólidas, particularmente en aplicaciones actuales de inteligencia artificial, donde un agente puede trabajar en un entorno dinámico abierto con información ...
se sugiere en la literatura, la revisión y actualización de creencias y de bases del conocimiento, es un tema importante, aún no resuelto en la representación del conocimiento y del razonamiento en la Answer ...
Its •-update program is Π ∪ Π 2 ∪ Π G , where Π G is a generalised program of M ∩ A * for some minimal generalised answer set M of Π A * and "•" is the corresponding update operator. ...
doi:10.29057/esh.v1i1.3010
fatcat:wifcuapdn5f7xpeqkg3xnlkscy
On Some Differences Between Semantics of Logic Program Updates
[chapter]
2004
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 2007; you can also visit the original URL.
The file type is application/pdf.
Since the introduction of logic program updates based on causal rejection of rules, several different semantics were set forth. ...
In this paper we redefine such existing semantics, and set forth a new one, all in the more general setting of Generalized Logic Programs, in a way that facilitates their comparisons. ...
The dynamic answer-set semantics generalizes the update answer-set semantics [4] , originally defined for DLPs consisting of extended logic programs only i.e., without default negation in the heads of ...
doi:10.1007/978-3-540-30498-2_38
fatcat:o42tce4mxvd5tfeqv4ajqo4ita
The rise and fall of semantic rule updates based on SE-models
2013
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 2020; 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:
2013 pre-print arXiv:1306.3884v1 fatcat:6myskxnnkra4hi5oaxtcbbkqfu
of belief update to tackle the problem of updating (instead of revising) answer-set programs. ...
AbstractLogic programs under the stable model semantics, or answer-set programs, provide an expressive rule-based knowledge representation framework, featuring a formal, declarative and well-understood ...
In the following we show that such counterintuitive behaviour is not specific to ⊕, but extends to all semantic update operators for answer-set programs based on the wellestablished notions of SE-models ...
doi:10.1017/s1471068413000100
fatcat:4lwuyrc7d5fqnjndpnr6jduba4
Page 7264 of Mathematical Reviews Vol. , Issue 2004i
[page]
2004
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.
Using update pro- grams, computation of updates is realized on top of the existing procedures for answer set programming with the additional mech- anism of selecting U-minimal answer sets. ...
(English summary)
Special issue on programming with answer sets.
Theory Pract. Log. Program. 3 (2003), no. 4-5, 569-607. ...
Enhancing the expressive power of the U-Datalog language
[article]
2004
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 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we provide a semantics, based on stratification, handling the use of negated atoms in U-Datalog programs, and we show which problems arise in defining a compositional semantics. ...
U-Datalog has been developed with the aim of providing a set-oriented logical update language, guaranteeing update parallelism in the context of a Datalog-like language. ...
In U-Datalog, each solution contains a substitution for the query variables and a set of updates. The execution of a goal is based on a deferred semantics. ...
arXiv:cs/0404003v1
fatcat:yqp7aimjmzb7ziptj35yp7cuna
Transactions and updates in deductive databases
1997
IEEE Transactions on Knowledge and Data Engineering
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 2003; you can also visit the original URL.
The file type is application/pdf.
We also package set of updates into transactions and we provide a formal semantics for transactions. ...
The approach is based on a declarative speci cation of updates in rule bodies. Updates are not executed as soon are evaluated. ...
For example, in a query rule language one can be interested in modeling the set of answers that are computed as result of a query (as in Datalog), or just one of these answers (as in logic programming) ...
doi:10.1109/69.634755
fatcat:7aczjyznkjg6jarmhozqq7rg64
A Coalgebraic Semantics for Epistemic Programs
2003
Electronical Notes 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 2019; you can also visit the original URL.
The file type is application/pdf.
Then, I introduce a new, alternative, more refined semantics for epistemic programs: programs as "epistemic coalgebras". ...
I show that the "relational" semantics of epistemic programs, given in [BMS2] in terms of epistemic updates, can be understood in terms of functors on the category of coalgebras and natural transformations ...
This is absent in the update semantics, and as a result the operation of answering a question (as defined above) does not make any sense in update semantics: there simply is no operation on updates which ...
doi:10.1016/s1571-0661(04)80630-3
fatcat:5te2d3kaezaz7eaxdq7ef63urm
On properties of update sequences based on causal rejection
2002
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 2008; you can also visit the original URL.
The file type is application/pdf.
In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. ...
For this purpose, we review postulates and principles for update and revision operators which have been proposed in the area of theory change and nonmonotonic reasoning. ...
for their useful remarks and corrections. ...
doi:10.1017/s1471068401001247
fatcat:ah3j3kk6tjauvbvh5jgww5irr4
On Properties of Update Sequences Based on Causal Rejection
[article]
2001
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 2017; you can also visit the original URL.
The file type is application/pdf.
We consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under answer set semantics. ...
Finally, we deal with computational complexity of our approach, and outline how the update semantics and its refinements can be implemented on top of existing logic programming engines. ...
for their useful remarks and corrections. ...
arXiv:cs/0109006v1
fatcat:lgiuthpwx5fsngn32esqgapvze
Well Founded Semantics for Logic Program Updates
[chapter]
2004
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 2008; you can also visit the original URL.
The file type is application/pdf.
Over the last years various semantics have been proposed for dealing with updates of logic programs by (other) logic programs. ...
In this paper we propose a well founded semantics for logic programs updates. We motivate our proposal with both practical and theoretical argumentations. ...
A well founded based semantics for LPs updates seems to be the answer for domains where the above requirements are added with the need to update knowledge. ...
doi:10.1007/978-3-540-30498-2_40
fatcat:6fqfhtivjjdn3j4utk65gxtvaq
A language for updating logic programs and its implementation
1995
The Journal 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 2017; you can also visit the original URL.
The file type is application/pdf.
This paper proposes an update language, called ULL, for knowledge systems based on logic programming. ...
Thus, simple control structures are defined for combining the basic updates into programs capable of expressing complex updates. ...
The authors gratefully acknowledge Geraldine Scalzo and Carlo Zaniolo for many fruitflfl discussions about update language applications and theory. ...
doi:10.1016/0743-1066(94)00025-2
fatcat:rhuekdv57rgdtjc3x24vaz25ue
A Schema for Generating Update Semantics
2012
International Journal of Advanced Computer Science and Applications
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.
The schema proposed is based on a concept called minimal generalized S models, where S is any of the logic programming semantics. Each update semantics is associated to an update operator. ...
In this paper, we present a general schema for defining new update semantics. ...
The semantics of minimal generalized answer sets is based on the stable semantics. ...
doi:10.14569/ijacsa.2012.030324
fatcat:jjg6qh4il5a4zi3jpzrivrwpaa
Updates in Answer Set Programming: An Approach Based on Basic Structural Properties
[article]
2006
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 2017; you can also visit the original URL.
The file type is application/pdf.
In addition, we consider other five additional basic properties about update programs and we show that the operator of Eiter et al. satisfies them. ...
We have studied the update operator defined for update sequences by Eiter et al. without tautologies and we have observed that it satisfies an interesting property This property, which we call Weak Independence ...
Acknowledgements We would like to thank Vladimir Lifschitz for his remark regarding Lemma 1. ...
arXiv:cs/0609167v1
fatcat:uek7df2cnra5vpnbwezbwpt6by
The semantics of program dependence
1989
Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation - PLDI '89
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 2019; you can also visit the original URL.
The file type is application/pdf.
Optimizing and parallelizing compilers for procedural languages rely on various forms of program dependence graphs (pdgs) to express the essential control and data dependences among atomic program operations ...
In this paper, we provide a semantic justification for this practice by deriving two different forms of program dependence graph-the output pdg and the def-order pdg-and their semantic definitions from ...
On the other hand, the goal of denotational semantics [9] is to define a functional meaning for programs that explains their operational behavior, yet avoids machine-specific details. ...
doi:10.1145/73141.74820
dblp:conf/pldi/CartwrightF89
fatcat:jjbp5gkghva3jayswi5huz4ab4
« Previous
Showing results 1 — 15 out of 64,119 results