Results 1  10
of
2,581,596
A Note on Logic Programming FixedPoint Semantics
"... In this paper, we present an account of classical Logic Programming fixedpoint semantics in terms of two standard categorical constructions in which the least Herbrand model is characterized by properties of universality. ..."
Abstract
 Add to MetaCart
In this paper, we present an account of classical Logic Programming fixedpoint semantics in terms of two standard categorical constructions in which the least Herbrand model is characterized by properties of universality.
A Fixed Point Semantics for the ATMS
 Journal of Logic Computation
, 1993
"... In [CTW90], the ATMS resolution mechanisms have been formalized, using the concept of DKtree. We propose in this paper a new and simple approach based on the fixed point theory and an original demonstration of the completeness of these mechanisms. We first introduce the basic definitions of terms, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In [CTW90], the ATMS resolution mechanisms have been formalized, using the concept of DKtree. We propose in this paper a new and simple approach based on the fixed point theory and an original demonstration of the completeness of these mechanisms. We first introduce the basic definitions of terms
A fixed point semantics for an extended CLP language
 In 13th International Workshop on Functional and (Constraint) Logic Programming (WFLP’04) Herbert Kuchen editor. Technical Report AIB200405
, 2004
"... Abstract. In [10] an extension of traditional Logic Programming was introduced combining two improving approaches. On one hand, extending Horn logic to hereditary Harrop formulas, in order to enhance the expressive power, and on the other incorporating constraints, in order to improve the efficien ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
the efficiency. The constraint logic programming language obtained from such combination was in need of a declarative semantics. In this paper, we present a fixed point semantics for it. Taking as starting point the technique used by Miller to interpret intuitionistic implication in goals, we have formulated a
Formalizing Two Fixed Point Semantics for HH(C)
"... Abstract. The scheme HH(C) emerged as a double extension of traditional Logic Programming. On one hand, extending Horn logic to hereditary Harrop formulas (HH), in order to improve the expressive power; on the other, incorporating constraints, in order to increase the efficiency. The behavior of su ..."
Abstract
 Add to MetaCart
. Recently, some attempts to define more declarative semantics for HH(C) has been done by the authors. Here such works are enlarged and improved. Two declarative semantics for HH(C) based on fixed point techniques are revisited. They are proved to be equivalent and the corresponding theorems of soundness
Gödel FL0 with Greatest FixedPoint Semantics?
"... Abstract. We study the fuzzy extension of FL0 with semantics based on the Gödel tnorm. We show that gfpsubsumption w.r.t. a finite set of primitive definitions can be characterized by a relation on weighted automata, and use this result to provide tight complexity bounds for reasoning in this logi ..."
Abstract
 Add to MetaCart
Abstract. We study the fuzzy extension of FL0 with semantics based on the Gödel tnorm. We show that gfpsubsumption w.r.t. a finite set of primitive definitions can be characterized by a relation on weighted automata, and use this result to provide tight complexity bounds for reasoning
The Fuzzy Description Logic GFL0 with Greatest FixedPoint Semantics?
"... Abstract. We study the fuzzy extension of the Description Logic FL0 with semantics based on the Gödel tnorm. We show that subsumption w.r.t. a finite set of primitive definitions, using greatest fixedpoint semantics, can be characterized by a relation on weighted automata. We use this result to p ..."
Abstract
 Add to MetaCart
Abstract. We study the fuzzy extension of the Description Logic FL0 with semantics based on the Gödel tnorm. We show that subsumption w.r.t. a finite set of primitive definitions, using greatest fixedpoint semantics, can be characterized by a relation on weighted automata. We use this result
94720 DiscreteEvent Systems: Generalizing Metric Spaces and FixedPoint Semantics
, 2005
"... Abstract. This paper studies the semantics of discreteevent systems as a concurrent model of computation. The classical approach, which is based on metric spaces, does not handle well multiplicities of simultaneous events, yet such simultaneity is a common property of discreteevent models and mode ..."
Abstract
 Add to MetaCart
than an element of the nonnegative reals.) A straightforward generalization of the Banach fixed point theorem to tetric spaces supports the definition of a fixedpoint semantics and generalizations of wellknown sufficient conditions for avoidance of Zeno conditions. 1
Preference Logic Grammars: Fixed Point Semantics and Application to Data Standardization
 ARTIFICIAL INTELLIGENCE
, 2002
"... The addition of preferences to normal logic programs is a convenient way to represent many aspects of default reasoning. If the derivation of an atom A 1 is preferred to that of an atom A 2 , a preference rule can be defined so that A 2 is derived only if A 1 is not. Although such situations can ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
themselves. In this paper we define a general fixedpoint semantics for preference logic programs based on an embedding into the wellfounded semantics, and discuss its features and relation to previous preference logic semantics. We then study how preference logic grammars are used in data
Computing the Least Fixpoint Semantics of Definite Logic Programs Using
, 2009
"... Abstract: We present the semantic foundations for computing the least fixpoint semantics of definite logic programs using only standard operations over boolean functions. More precisely, we propose a representation of sets of firstorder terms by boolean functions and a provably sound formulation o ..."
Abstract
 Add to MetaCart
Abstract: We present the semantic foundations for computing the least fixpoint semantics of definite logic programs using only standard operations over boolean functions. More precisely, we propose a representation of sets of firstorder terms by boolean functions and a provably sound formulation
Characteristic Formulae for FixedPoint Semantics: A General Framework
 UNDER CONSIDERATION FOR PUBLICATION IN MATH. STRUCT. IN COMP. SCIENCE
, 2010
"... The literature on concurrency theory offers a wealth of examples of characteristicformula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed points of suitable functions. Such constructions and their proof ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
The literature on concurrency theory offers a wealth of examples of characteristicformula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed points of suitable functions. Such constructions
Results 1  10
of
2,581,596