Results 1  10
of
13,226
The Alternating Fixpoint of Logic Programs with Negation \Lambda
, 1995
"... The principal contributions of this work are (1) that the alternating fixpoint partial model is identical to the wellfounded partial model, and (2) that alternating fixpoint logic is at least as expressive as fixpoint logic on all structures. Also, on finite structures, fixpoint logic is as express ..."
Abstract
 Add to MetaCart
The principal contributions of this work are (1) that the alternating fixpoint partial model is identical to the wellfounded partial model, and (2) that alternating fixpoint logic is at least as expressive as fixpoint logic on all structures. Also, on finite structures, fixpoint logic
A Logic of Fixpoint Definitions
"... Abstract. We introduce the fixpoint definitions, which is a reformulation of fixpoint logic constructs. We define the logic FO(FD), an extension of first order logic with fixpoint definitions. We illustrate the relation between fixpoint definitions and nonmonotone inductive definitions in FO(ID), ..."
Abstract
 Add to MetaCart
Abstract. We introduce the fixpoint definitions, which is a reformulation of fixpoint logic constructs. We define the logic FO(FD), an extension of first order logic with fixpoint definitions. We illustrate the relation between fixpoint definitions and nonmonotone inductive definitions in FO
The complexity of model checking higherorder fixpoint logic
 Logical Methods in Computer Science
"... Abstract. HigherOrder Fixpoint Logic (HFL) is a hybrid of the simply typed λcalculus and the modal µcalculus. This makes it a highly expressive temporal logic that is capable of expressing various interesting correctness properties of programs that are not expressible in the modal µcalculus. Thi ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Abstract. HigherOrder Fixpoint Logic (HFL) is a hybrid of the simply typed λcalculus and the modal µcalculus. This makes it a highly expressive temporal logic that is capable of expressing various interesting correctness properties of programs that are not expressible in the modal µ
THE COMPLEXITY OF MODEL CHECKING HIGHER ORDER FIXPOINT LOGIC
"... Abstract. Higher Order Fixpoint Logic (HFL) is a hybrid of the simply typed λcalculus and the modal µcalculus. This makes it a highly expressive temporal logic that is capable of expressing various interesting correctness properties of programs that are not expressible in the modal µcalculus. Thi ..."
Abstract
 Add to MetaCart
Abstract. Higher Order Fixpoint Logic (HFL) is a hybrid of the simply typed λcalculus and the modal µcalculus. This makes it a highly expressive temporal logic that is capable of expressing various interesting correctness properties of programs that are not expressible in the modal µ
Complexity and Expressive Power of Logic Programming
, 1997
"... This paper surveys various complexity results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results ..."
Abstract

Cited by 360 (57 self)
 Add to MetaCart
This paper surveys various complexity results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical
The Differential Fixpoint of General Logic Programs
 Proc. of the Workshop DDLP'96 on Deductive Databases and Logic Programming. 4th Workshop in conjunction with JICSLP'96
, 1996
"... We present a version of the alternating fixpoint procedure that is fully incremental. Using ideas of partial evaluation techniques we can compute the wellfounded model of logic programs with negation bottomup without any recomputations. Further extensions of the semantics, e.g. to stable models or ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We present a version of the alternating fixpoint procedure that is fully incremental. Using ideas of partial evaluation techniques we can compute the wellfounded model of logic programs with negation bottomup without any recomputations. Further extensions of the semantics, e.g. to stable models
Ontologies: Silver Bullet for Knowledge Management and Electronic Commerce
, 2007
"... Currently computers are changing from single isolated devices to entry points into a world wide network of information exchange and business transactions called the World Wide Web (WWW). Therefore support in the exchange of data, information, and knowledge exchange is becoming the key issue in cur ..."
Abstract

Cited by 643 (46 self)
 Add to MetaCart
Currently computers are changing from single isolated devices to entry points into a world wide network of information exchange and business transactions called the World Wide Web (WWW). Therefore support in the exchange of data, information, and knowledge exchange is becoming the key issue
A Simple Model of Capital Market Equilibrium with Incomplete Information
 JOURNAL OF FINANCE
, 1987
"... The sphere of modern financial economics encompases finance, micro investment theory and much of the economics of uncertainty. As is evident from its influence on other branches of economics including public finance, industrial organization and monetary theory, the boundaries of this sphere are both ..."
Abstract

Cited by 720 (2 self)
 Add to MetaCart
. But for all its mathematical refinement, the research has nevertheless had a direct and significant influence on practice. It was not always thus. Thirty years ago, finance theory was little more than a collection of anecdotes, rules of thumb, and manipulations of accounting data with an almost exclusive
Results 1  10
of
13,226