Invariants and Well-Foundedness in Program Algebra

2010 ◽  
pp. 1-14 ◽  
Author(s):  
Ian J. Hayes
Keyword(s):  
Program Algebra ◽  
Well Foundedness

A Modal Semantics of Negation in Logic Programming

1992 ◽  
Vol 16 (3-4) ◽  
pp. 231-262
Author(s):  
Philippe Balbiani
Keyword(s):  
Modal Logic ◽  
Logic Programming ◽  
Modal Logics ◽  
Kripke Models ◽  
Logic Programs ◽  
Modal Semantics ◽  
Soundness And Completeness ◽  
Modal Completion ◽  
Well Foundedness

The beauty of modal logics and their interest lie in their ability to represent such different intensional concepts as knowledge, time, obligation, provability in arithmetic, … according to the properties satisfied by the accessibility relations of their Kripke models (transitivity, reflexivity, symmetry, well-foundedness, …). The purpose of this paper is to study the ability of modal logics to represent the concepts of provability and unprovability in logic programming. The use of modal logic to study the semantics of logic programming with negation is defended with the help of a modal completion formula. This formula is a modal translation of Clack’s formula. It gives soundness and completeness proofs for the negation as failure rule. It offers a formal characterization of unprovability in logic programs. It characterizes as well its stratified semantics.

scholarly journals Program algebra with a jump-shift instruction

2008 ◽  
Vol 6 (4) ◽  
pp. 553-563 ◽  
Author(s):  
J.A. Bergstra ◽  
C.A. Middelburg
Keyword(s):  
Program Algebra

On the Irreflexivity, Transitivity, and Well-Foundedness of Causation

2018 ◽  
pp. 198-214
Author(s):  
Christopher Gregory Weaver
Keyword(s):  
Well Foundedness

Well-foundedness conditions connected with left-distributivity

2002 ◽  
Vol 47 (1) ◽  
pp. 65-68 ◽  
Author(s):  
Richard Laver ◽  
John A. Moody
Keyword(s):  
Well Foundedness

Paradox as a Guide to Ground

Philosophy ◽  
2020 ◽  
Vol 95 (2) ◽  
pp. 185-209
Author(s):  
Martin Pleitz
Keyword(s):  
Causal Explanation ◽  
Limit Case ◽  
Standard Requirement ◽  
Philosophical Inquiry ◽  
Yablo’S Paradox ◽  
Metaphysical Grounding ◽  
Zeno's Paradoxes ◽  
Large Groups ◽  
The Liar ◽  
Well Foundedness

AbstractI will use paradox as a guide to metaphysical grounding, a kind of non-causal explanation that has recently shown itself to play a pivotal role in philosophical inquiry. Specifically, I will analyze the grounding structure of the Predestination paradox, the regresses of Carroll and Bradley, Russell's paradox and the Liar, Yablo's paradox, Zeno's paradoxes, and a novel omega plus one variant of Yablo's paradox, and thus find reason for the following: We should continue to characterize grounding as asymmetrical and irreflexive. We should change our understanding of the transitivity of grounding in a certain sense. We should require foundationality in a new, generalized sense, that has well-foundedness as its limit case. Meta-grounding is important. The polarity of grounding can be crucial. Thus we will learn a lot about structural properties of grounding from considering the various paradoxes. On the way, grounding will also turn out to be relevant to the diagnosis (if not the solution) of paradox. All the paradoxes under consideration will turn out to be breaches of some standard requirement on grounding, which makes uniform solutions of large groups of these paradoxes more desirable. In sum, bringing together paradox and grounding will be shown to be of considerable value to philosophy.1

scholarly journals plasp 3: Towards Effective ASP Planning

2019 ◽  
Vol 19 (3) ◽  
pp. 477-504 ◽  
Author(s):  
YANNIS DIMOPOULOS ◽  
MARTIN GEBSER ◽  
PATRICK LÜHNE ◽  
JAVIER ROMERO ◽  
TORSTEN SCHAUB
Keyword(s):  
Empirical Analysis ◽  
Answer Set Programming ◽  
Planning Techniques ◽  
Domain Definition ◽  
Advanced Planning ◽  
Planning Algorithms ◽  
Well Foundedness ◽  
Answer Set

AbstractWe describe the new version of the Planning Domain Definition Language (PDDL)-to-Answer Set Programming (ASP) translatorplasp. First, it widens the range of accepted PDDL features. Second, it contains novel planning encodings, some inspired by Satisfiability Testing (SAT) planning and others exploiting ASP features such as well-foundedness. All of them are designed for handling multivalued fluents in order to capture both PDDL as well as SAS planning formats. Third, enabled by multishot ASP solving, it offers advanced planning algorithms also borrowed from SAT planning. As a result,plaspprovides us with an ASP-based framework for studying a variety of planning techniques in a uniform setting. Finally, we demonstrate in an empirical analysis that these techniques have a significant impact on the performance of ASP planning.

Sign in / Sign up

Export Citation Format

Share Document