Results 1 - 10
of
947
Static filtering on stratified programs
, 1993
"... We extend static filtering in 181, a query optimization strategy based on seminaive evaluation on system graphs. so that it can efficiently handle stratified programs without extra overhead. The computation of static filters is formalized as a transformation so that the least fiied point of the tran ..."
Abstract
- Add to MetaCart
We extend static filtering in 181, a query optimization strategy based on seminaive evaluation on system graphs. so that it can efficiently handle stratified programs without extra overhead. The computation of static filters is formalized as a transformation so that the least fiied point
The expressiveness of locally stratified programs
- Annals of Mathematics and Artificial Intelligence
, 1995
"... This paper completes an investigation of the logical expressibility of finite, locally stratified, general logic programs. We show that every hyperarithmetic set can be defined by a suitably chosen locally stratified logic program (as a set of values of a predicate over its perfect model). This is a ..."
Abstract
-
Cited by 16 (2 self)
- Add to MetaCart
This paper completes an investigation of the logical expressibility of finite, locally stratified, general logic programs. We show that every hyperarithmetic set can be defined by a suitably chosen locally stratified logic program (as a set of values of a predicate over its perfect model
Syntactically Recognizable Modularly Stratified Programs
- University of Melbourne, Computer Science Department
, 1994
"... We present an efficient evaluation technique for modularly stratified programs for which the local strata level mappings are known at compile time. We present an important subclass of these programs (called EMS-programs) in which one can easily express problems such as shortest distance, company own ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
We present an efficient evaluation technique for modularly stratified programs for which the local strata level mappings are known at compile time. We present an important subclass of these programs (called EMS-programs) in which one can easily express problems such as shortest distance, company
STRPRO Tool for Manipulating Stratified Programs Based on SEPN
- in Proceedings of World Enformatika Conference, Turkey
, 2005
"... Abstract- Negation is useful in the majority of the real world applications. However, its introduction leads to semantic and canonical problems. SEPN nets are well adapted extension of predicate nets for the definition and manipulation of stratified programs. This formalism is characterized by two m ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Abstract- Negation is useful in the majority of the real world applications. However, its introduction leads to semantic and canonical problems. SEPN nets are well adapted extension of predicate nets for the definition and manipulation of stratified programs. This formalism is characterized by two
STRATIFIED PROGRAMMING INTEGRATED DEVELOPMENT ENVIRONMENT (SPIDER)
"... This paper describes the functionality required for a development environment that supports stratified programming (SP), a novel software development method that we have proposed recently [1, 2]. In this paper we discuss the case when program strata are controlled outside the programming language an ..."
Abstract
- Add to MetaCart
This paper describes the functionality required for a development environment that supports stratified programming (SP), a novel software development method that we have proposed recently [1, 2]. In this paper we discuss the case when program strata are controlled outside the programming language
The Stable Model Semantics For Logic Programming
, 1988
"... We propose a new declarative semantics for logic programs with negation. Its formulation is quite simple; at the same time, it is more general than the iterated fixed point semantics for stratied programs, and is applicable to some useful programs that are not stratified. ..."
Abstract
-
Cited by 1847 (63 self)
- Add to MetaCart
We propose a new declarative semantics for logic programs with negation. Its formulation is quite simple; at the same time, it is more general than the iterated fixed point semantics for stratied programs, and is applicable to some useful programs that are not stratified.
New approach for Manipulation of Stratified Programs”, submitted for publication in AISC
, 2005
"... Abstract- Negation is useful in the majority of the real world applications. However, its introduction leads to semantic and canonical problems. We propose in this paper an approach based on stratification to deal with negation problems. This approach is based on an extension of predicates nets. It ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
. It is characterized with two main contributions. The first concerns the management of the whole class of stratified programs. The second contribution is related to usual operations optimizations on stratified programs (maximal stratification, incremental updates …).
An abstract machine for fixed-order dynamically stratified programs
- In Proceedings of the Thirteenth International Conference on Automated Deduction, LNAI
, 1996
"... ..."
STRATIFIED PROGRAMMING: TOWARDS A NEW PARADIGM FOR SOFTWARE DEVELOPMENT
"... This paper introduces stratified programming, a novel approach for program construction. In essence, stratified programming allows the developer to build and execute software at various levels of abstraction, each level corresponding to a program stratum that provides a specific degree of functional ..."
Abstract
- Add to MetaCart
This paper introduces stratified programming, a novel approach for program construction. In essence, stratified programming allows the developer to build and execute software at various levels of abstraction, each level corresponding to a program stratum that provides a specific degree
Operational Semantics for SLG Evaluation. Part 1: Modularly Stratified Programs
, 1994
"... SLG evaluation has received attention not only because of its theoretical properties --- it computes well-founded and three-valued stable models for general logic programs --- but also because it can be efficiently implemented. The SLG-WAM of XSB has proven an order of magnitude or more faster than ..."
Abstract
- Add to MetaCart
similar systems when executing modularly stratified programs. This paper proposes an operational semantics, SLGO , which bridges a gap between the general description of SLG in [2] and the SLG-WAM. As a result, SLGO , which shares soundness and completeness properties with SLG, formalizes the scheduling
Results 1 - 10
of
947