Results 1  10
of
514
procedural and fixpoint semantics of logic programs, in
 Proc. 8th Int’l Symp. on Theoretical Aspects of Computer Science (STACS ’91
, 1991
"... In this paper, we propose new notions related to unfolding semantics which clarify the relationship between procedural and fixpoint semantics of logic programs. We introduce 3 main new ideas: the unfolding rule has an associativity property that ensures the adequacy of unfolding semantics with the ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
In this paper, we propose new notions related to unfolding semantics which clarify the relationship between procedural and fixpoint semantics of logic programs. We introduce 3 main new ideas: the unfolding rule has an associativity property that ensures the adequacy of unfolding semantics
Fixpoint Semantics and Simulation
 THEOR. COMP. SCI
, 2000
"... A general functorial framework for recursive definitions is presented in which simulation of a definition scheme by another one implies an ordering between the values defined by these schemes in an arbitrary model. Under mild conditions on the functor involved, the converse implication also holds: a ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
A general functorial framework for recursive definitions is presented in which simulation of a definition scheme by another one implies an ordering between the values defined by these schemes in an arbitrary model. Under mild conditions on the functor involved, the converse implication also holds: a model is constructed such that, if the values defined are ordered, there is a simulation between the definition schemes. The theory is illustrated by applications to contextfree grammars, recursive procedures in imperative languages, and simulation and bisimulation of processes.
A Fixpoint Semantics for Reasoning About Finite Failure
"... Our aim is to define a new fixpoint semantics which correctly models finite failure. In order to achieve this goal a new fixpoint operator is derived from a "suitable" concrete semantics by defining a Galois insertion modeling finite failure. The corresponding abstract fixpoint semantics c ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Our aim is to define a new fixpoint semantics which correctly models finite failure. In order to achieve this goal a new fixpoint operator is derived from a "suitable" concrete semantics by defining a Galois insertion modeling finite failure. The corresponding abstract fixpoint semantics
Fixpoint semantics for logic programming  a survey
, 2000
"... The variety of semantical approaches that have been invented for logic programs is quite broad, drawing on classical and manyvalued logic, lattice theory, game theory, and topology. One source of this richness is the inherent nonmonotonicity of its negation, something that does not have close para ..."
Abstract

Cited by 130 (0 self)
 Add to MetaCart
of approaches to the semantics of logic programs: that based on fixpoint theory. We do not attempt to cover much beyond this single area, which is already remarkably fruitful. We hope readers will see parallels with, and the divergences from the better known fixpoint treatments developed for other programming
An Effective Fixpoint Semantics for Linear Logic Programs
 THEORY AND PRACTICE OF LOGIC PROGRAMMING
, 2002
"... In this paper we investigate the theoretical foundation of a new bottomup semantics for linear logic programs, and more precisely for the fragment of LinLog (Andreoli, 1992) that consists of the language LO (Andreoli & Pareschi, 1991) enriched with the constant 1. We use constraints to symbolic ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
to symbolically and finitely represent possibly infinite collections of provable goals. We define a fixpoint semantics based on a new operator in the style of TP working over constraints. An application of the fixpoint operator can be computed algorithmically. As sufficient conditions for termination, we show
Query Evaluation in Deductive Databases with Alternating Fixpoint Semantics
 ACM TRANSACTIONS ON DATABASE SYSTEMS
, 1995
"... Firstorder formulas allow natural descriptions of queries and rules. Van Gelder's alternating fixpoint semantics extends the wellfounded semantics of normal logic programs to general logic programs with arbitrary firstorder formulas in rule bodies. However, an implementation of general logic ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Firstorder formulas allow natural descriptions of queries and rules. Van Gelder's alternating fixpoint semantics extends the wellfounded semantics of normal logic programs to general logic programs with arbitrary firstorder formulas in rule bodies. However, an implementation of general
A Compact Fixpoint Semantics for Term Rewriting Systems
 Theoretical Computer Science
, 2010
"... This work is motivated by the fact that a “compact ” semantics for term rewriting systems, which is essential for the development of effective semanticsbased program manipulation tools (e.g. automatic program analyzers and debuggers), does not exist. The bigstep rewriting semantics that is most co ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
. Therefore, in this article, we present a compressed, goalindependent collecting fixpoint semantics that contains the smallest set of terms that are sufficient to describe, by semantic closure, all possible rewritings. We prove soundness and completeness under ascertained conditions. The compactness
Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation
 Information and Computation
, 1997
"... Disjunctive logic programs have become a powerful tool in knowledge representation and commonsense reasoning. This paper focuses on stable model semantics, currently the most widely acknowledged semantics for disjunctive logic programs. After presenting a new notion of unfounded sets for disjunct ..."
Abstract

Cited by 89 (20 self)
 Add to MetaCart
can be defined equivalently by a property of their false literals, as a model is stable iff the set of its false literals coincides with its greatest unfounded set. We then generalize the wellfounded WP operator to disjunctive logic programs, give a fixpoint semantics for disjunctive stable models
On the Equivalence of Incremental and Fixpoint Semantics for Business Artifacts with
"... Abstract. Business artifacts (BAs, or artifacts) are used to model conceptual entities that are central to guiding the operations of a business, and whose content changes as they move through those operations. The recently introduced GuardStageMilestone (GSM) metamodel for artifact lifecycles i ..."
Abstract
 Add to MetaCart
is declarative in nature, and allows concurrent execution of longrunning (possibly humanexecuted) activities. Modularity is incorporated through the use of hierarchical clustering of activities. The GSM operational semantics is based on a variant of EventConditionAction (ECA) rules, which are used
Polarized Proof Nets with Cycles and Fixpoints Semantics
"... Abstract. Starting from Laurent’s work on Polarized Linear Logic, we define a new polarized linear deduction system which handles recursion. This is achieved by extending the cutrule, in such a way that iteration unrolling is achieved by cutelimination. The proof nets counterpart of this extension ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
of this extension is obtained by allowing oriented cycles, which had no meaning in usual polarized linear logic. We also free proof nets from additional constraints, leading up to a correctness criterion as straightforward as possible (since almost all proof structures are correct). Our system has a sound semantics
Results 1  10
of
514