6,829 Hits in 6.5 sec

On Strong and Default Negation in Logic Program Updates (Extended Version) [article]

Martin Slota, Martin Baláz, João Leite
2014 arXiv   pre-print
Existing semantics for answer-set program updates fall into two categories: either they consider only strong negation in heads of rules, or they primarily rely on default negation in heads of rules and  ...  Then we extend one of the most advanced semantics with direct support for strong negation and show that it satisfies the outlined principles as well as a variety of other desirable properties.  ...  Logic Programs In the following we present the syntax of non-disjunctive logic programs with both strong and default negation in heads and bodies of rules, along with the definition of stable models of  ... 
arXiv:1404.6784v4 fatcat:njuzm3nhsbhg7m2467okfakh7e

Back and Forth Between Rules and SE-Models (Extended Version) [article]

Martin Slota, João Leite
2011 arXiv   pre-print
Rules in logic programming encode information about mutual interdependencies between literals that is not captured by any of the commonly used semantics.  ...  Finally, we discuss the introduction of two notions of equivalence, both stronger than strong equivalence [1] and weaker than strong update equivalence [2], which seem more suitable whenever the dependency  ...  Acknowledgement We would like to thank Han The Anh, Matthias Knorr and the anonymous reviewers for their comments that helped to improve the paper.  ... 
arXiv:1102.5385v2 fatcat:kjfy2ssbcvhb3ehpryqu3pity4

Language-Integrated Updatable Views (Extended version) [article]

Rudi Horn, Simon Fowler, James Cheney
2020 arXiv   pre-print
In this paper, we propose the first full account of relational lenses in a functional programming language, by extending the Links web programming language.  ...  Relational lenses are a modern approach to the view update problem in relational databases.  ...  ACKNOWLEDGMENTS Thanks to the anonymous reviewers for their helpful comments and to Simon Harding and Jo Sharman for discussion of the GtoPdb curation interface.  ... 
arXiv:2003.02191v2 fatcat:io3pyy35tje6hgwp6t36cb6yse

Towards closed world reasoning in dynamic open worlds

2010 Theory and Practice of Logic Programming  
We focus on knowledge updates and, considering the state of the art of belief update, ontology update and rule update, we show that current solutions are only partial and difficult to combine.  ...  Then we extend the existing work on ABox updates with rules, provide a semantics for such evolving hybrid knowledge bases and study its basic properties.To the best of our knowledge, this is the first  ...  This type of negation is usually dubbed default negation or weak negation, to distinguish it from the classical negation used in Classical Logic.  ... 
doi:10.1017/s147106841000027x fatcat:bdgfmyvw6rcvvgswcauujpu67a

PUG: A Framework and Practical Implementation for Why & Why-Not Provenance (extended version) [article]

Seokki Lee, Bertram Ludaescher, Boris Glavic
2018 arXiv   pre-print
The implementation of this model in our PUG (Provenance Unification through Graphs) system takes a provenance question and Datalog query as an input and generates a Datalog program that computes an explanation  ...  In this work, we present the first practical approach for answering such questions for queries with negation (first- order queries).  ...  An explanation is then one particular solution to this view update problem.  ... 
arXiv:1808.05752v1 fatcat:wqftuxkqtbfvjgffvrnbpdt524

Verification of Data-Aware Processes via Array-Based Systems (Extended Version) [article]

Diego Calvanese, Silvio Ghilardi, Alessandro Gianola, Marco Montali, Andrey Rivkin
2019 arXiv   pre-print
On the other, we are able to exploit SMT technology in implementations, building on the well-known MCMT model checker for array-based systems, and extending it to make all our foundational results fully  ...  On the one hand, we reconstruct (restricted to safety) the essence of some important decidability results obtained in the literature for artifact-centric systems, and we devise a genuinely novel class  ...  An extended version of this example is presented in Appendix A.1.  ... 
arXiv:1806.11459v2 fatcat:j3iv2rnwuvbpzdp6mnlcfie2mq

Static Race Detection and Mutex Safety and Liveness for Go Programs (extended version) [article]

Julia Gabet, Nobuko Yoshida
2021 arXiv   pre-print
In this paper, we develop a theory based on behavioural types to statically detect data races and deadlocks in Go programs.  ...  In Go programs, a number of concurrency bugs can be caused by a mixture of data races and communication problems.  ...  ⇒ ψ: the lowest fixed point can be expanded on the left of a logical implication; 4. if ψ ⇒ φ[Z := ψ] then ψ ⇒ νZ.φ: the greatest fixed point can be expanded on the right of a logical implication.  ... 
arXiv:2004.12859v2 fatcat:rapbqkchfzbovktuladsyeloum

Formal verification of an industrial UML-like model using mCRL2 (extended version) [article]

Anna Stramaglia, Jeroen J.A. Keiren
2022 arXiv   pre-print
We show that our verification approach is effective to uncover subtle issues in the industrial model and its implementation.  ...  In this paper we introduce Cordis models and their semantics. To enable formal verification, we define an automatic translation of Cordis models to the process algebraic specification language mCRL2.  ...  We thank Wieger Wesselink and Yousra Hafidi for contributions to the development of the mCRL2 translation, and Cordis Automation B.V. for their feedback on earlier versions of this paper.  ... 
arXiv:2205.08146v1 fatcat:3wfxtcmxxncmrn7momkkhiideq

Identifying Overly Restrictive Matching Patterns in SMT-based Program Verifiers (extended version) [article]

Alexandra Bugariu, Arshavir Ter-Gabrielyan, Peter Müller
2021 arXiv   pre-print
Universal quantifiers occur frequently in proof obligations produced by program verifiers, for instance, to axiomatize uninterpreted functions and to express properties of arrays.  ...  In this paper, we present the first technique that identifies and helps the users remedy the effects of overly restrictive matching patterns.  ...  We are also grateful to Felix Wolf for providing us the Gobra benchmarks, and to Evgenii Kotelnikov for his detailed explanations about Vampire.  ... 
arXiv:2105.04385v3 fatcat:j2z7cz5n7fgc5k2z3cgovzoxsa

The role of formalism in system requirements (full version) [article]

Jean-Michel Bruel, Sophie Ebersold, Florian Galinier, Alexandr Naumchev, Manuel Mazzara, Bertrand Meyer
2020 arXiv   pre-print
(This is the full version of the survey, including some sections and two appendices which, because of length restrictions, do not appear in the submitted version.)  ...  It presents approaches in all of these categories, altogether 22 different ones, including for example SysML, Relax, Eiffel, Event-B, Alloy.  ...  and Thuy Nguyen for his formalization of the LGS in Form-L.  ... 
arXiv:1911.02564v6 fatcat:mwsozk5m2rcjdj6whveuhx2bla

Belief, provability, and logic programs

José Júlio Alferes, Luís Moniz Pereira
1995 Journal of Applied Non-Classical Logics  
In particular we present here, for the first time, embeddings into epistemic logic of logic programs extended with a second kind of negation under the wellfounded semantics, and contrast them to the recent  ...  Because of the newly established relationship between our epistemic logic and extended program semantics, the former benefits from the procedures and implementations of the latter, and can be applied to  ...  Acknowledgments We acknowledge Esprit BRA Compulog 2 (no. 6810), and JNICT -Portugal for their support. Thanks to Carlos Damásio and Teodor Przymusinski for helpful discussions.  ... 
doi:10.1080/11663081.1995.10510842 fatcat:y2s4fqionjg6fnkbmysl7p5ixe

Prolegomena to logic programming for non-monotonic reasoning [chapter]

Jürgen Dix, Luís Moniz Pereira, Teodor Przymusinski
1997 Lecture Notes in Computer Science  
, e{answer{ sets, Nelson's strong negation, and well{founded semantics with pseudo and with explicit negation).  ...  The next couple of sections provide motivating examples and an overview of the main semantics paradigms for normal programs (stable models and well{founded) and for extended logic programs (answer{sets  ...  Lu s Moniz Pereira acknowledges also the support of JNICT/PRAXIS and its funding of the project MENTAL (#2/2.1/TIT/1593/95).  ... 
doi:10.1007/bfb0023799 fatcat:cv52p4si5reb7nvbrgiom52rga

On Some Differences Between Semantics of Logic Program Updates [chapter]

João Alexandre Leite
2004 Lecture Notes in Computer Science  
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.  ...  Since the introduction of logic program updates based on causal rejection of rules, several different semantics were set forth.  ...  (Extended) Logic Programs (GLP) (Logic Programs allowing both default and strong negation in the heads of rules), and [4] define the semantics of Update Answer Sets for sequences of Extended Logic Programs  ... 
doi:10.1007/978-3-540-30498-2_38 fatcat:o42tce4mxvd5tfeqv4ajqo4ita

A paraconsistent semantics with contradiction support detection [chapter]

Carlos Viegas Damásio, Luís Moniz Pereira
1997 Lecture Notes in Computer Science  
Afterwards, we show how to implement two recent modal contradiction related constructs in the language of extended logic programs in order to gain explicit control of contradiction propagation.  ...  We nish by making comparisons and drawing some conclusions.  ...  Default Most semantics for extended logic programs view default negation and explicit negation as unrelated.  ... 
doi:10.1007/3-540-63255-7_18 fatcat:sxakliqjwrdvxelmeoelp77nvu

A Generalised Semantics for Belief Updates - An Equivalence-based Approach

Jorge Hernández, Juan C. Acosta
2013 Ciencias Huasteca Boletín Científico de la Escuela Superior de Huejutla  
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 Set Programming  ...  An intuitive meaning of strong negation "∼" in logic programs with respect to the default negation "¬" is the following: a rule ρ 0 ← ¬ρ 1 allows to derive ρ 0 when there is no evidence of ρ 1 , while  ...  Such a problem has been introduced and overcome by Sakama and Inoue [23] by means of a semantics based on an extended particular version of abductive logic programming [16] .  ... 
doi:10.29057/esh.v1i1.3010 fatcat:wifcuapdn5f7xpeqkg3xnlkscy
« Previous Showing results 1 — 15 out of 6,829 results