Results 1  10
of
23,292
Weakly Stratified Logic Programs
, 1990
"... this paper we address the problem of declarative (or intended) semantics for logic programs. In [ABW88] Apt, Blair and Walker and  independently  Van Gelder [VG89] (see also [CH85]) introduced the class of stratified logic programs, ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
this paper we address the problem of declarative (or intended) semantics for logic programs. In [ABW88] Apt, Blair and Walker and  independently  Van Gelder [VG89] (see also [CH85]) introduced the class of stratified logic programs,
Verifying Parameterized Protocols by Transforming Stratified Logic Programs
"... We propose a method for the specification and the automated verification of temporal properties of parameterized protocols. Our method is based on logic programming and program transformation. We specify the properties of parameterized protocols by using an extension of stratified logic programs. Th ..."
Abstract
 Add to MetaCart
We propose a method for the specification and the automated verification of temporal properties of parameterized protocols. Our method is based on logic programming and program transformation. We specify the properties of parameterized protocols by using an extension of stratified logic programs
The Expressive Power of Stratified Logic Programs with Value Invention
 IN ICDT'95 (FIFTH INTERNATIONAL CONFERENCE ON DATA BASE THEORY), PRAGUE, LECTURE NOTES IN COMPUTER SCIENCE 893
, 1996
"... The expressive power of the family wILOG (:) of relational query languages is investigated. The languages are rule based, withvalue invention and stratified negation. The semantics for value invention is based on Skolem functor terms. Westudy a hierarchy of languages based on thenumber of strata ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
allowed in programs. We first show that, in presence of value invention, the class of stratified programs madeoftwo stratahas the whole expressive power of the family, thus expressing the computable queries. Wethen show that the language wILOG 6= of programs with non+ y and without negation
An abstract machine for tabled execution of fixedorder stratified logic programs
 ACM Transactions on Programming Languages and Systems
, 1998
"... SLG resolution uses tabling to evaluate nonfloundering normal logic programs according to the wellfounded semantics. The SLGWAM, which forms the engine of the XSB system, can compute inmemory recursive queries an order of magnitude faster than current deductive databases. At the same time, the SL ..."
Abstract

Cited by 87 (28 self)
 Add to MetaCart
SLG resolution uses tabling to evaluate nonfloundering normal logic programs according to the wellfounded semantics. The SLGWAM, which forms the engine of the XSB system, can compute inmemory recursive queries an order of magnitude faster than current deductive databases. At the same time
S.: Complexity results for checking equivalence of stratified logic programs
 Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI’07
, 2007
"... Recent research in nonmonotonic logic programming under the answerset semantics focuses on different notions of program equivalence. However, previous results do not address the important classes of stratified programs and its subclass of acyclic (i.e., recursionfree) programs, although they are r ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Recent research in nonmonotonic logic programming under the answerset semantics focuses on different notions of program equivalence. However, previous results do not address the important classes of stratified programs and its subclass of acyclic (i.e., recursionfree) programs, although
Indefinite Models and Parallel Positive Resolution for Disjunctive Stratified Logic Programs
"... The subject of this paper is the semantics of propositional disjunctive logic programs and indefinite deductive data bases. The concept of the indefinite model of a disjunctive logic program is introduced. The algorithm of computing the indefinite model and an algorithm of evaluation of clauses in ..."
Abstract
 Add to MetaCart
The subject of this paper is the semantics of propositional disjunctive logic programs and indefinite deductive data bases. The concept of the indefinite model of a disjunctive logic program is introduced. The algorithm of computing the indefinite model and an algorithm of evaluation of clauses
Expressing and Supporting Efficiently Greedy Algorithms as Locally Stratified Logic Programs
, 2015
"... The problem of expressing and supporting classical greedy algorithms in Datalog has been the focus of many significant research efforts that have produced very interesting solutions for particular algorithms. But we still lack a general treatment that characterizes the relationship of greedy algorit ..."
Abstract
 Add to MetaCart
algorithms to nonmonotonic theories and leads to asymptotically optimal implementations. In this paper, we propose a general solution to this problem. Our approach begins by identifying a class of locally stratified programs that subsumes XYstratified programs and is formally characterized using
Under consideration for publication in Theory and Practice of Logic Programming 1 On the Existence of Stable Models of Nonstratified Logic Programs
"... In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz’s answer sets semantics (initially defined as ‘stable model semantics’). This paper introduces a fundamental result, which is very relevant for Answer Set programming, and planning. For the firs ..."
Abstract
 Add to MetaCart
. For the first time since the definition of the stable model semantics, the class of logic programs for which a stable model exists is given a syntactic characterization. This condition may have a practical importance both for defining new algorithms for checking consistency and computing answer sets
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.
Description Logic Programs: Combining Logic Programs with Description Logic
, 2002
"... We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. To do so, we define a new intermediate knowledge representation (KR) ..."
Abstract

Cited by 529 (46 self)
 Add to MetaCart
We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. To do so, we define a new intermediate knowledge representation (KR
Results 1  10
of
23,292