Results 1  10
of
125
Propositional Semantics for Disjunctive Logic Programs
 Annals of Mathematics and Artificial Intelligence
, 1994
"... In this paper we study the properties of the class of headcyclefree extended disjunctive logic programs (HEDLPs), which includes, as a special case, all nondisjunctive extended logic programs. We show that any propositional HEDLP can be mapped in polynomial time into a propositional theory such th ..."
Abstract

Cited by 161 (2 self)
 Add to MetaCart
completeness of this class of disjunctive logic programs; it allows existing algorithms and tractable subsets for the satisfiability problem to be used in logic programming; it facilitates evaluation of the expressive power of disjunctive logic programs; and it leads to the discovery of useful similarities between stable
Splitting a Logic Program
 Principles of Knowledge Representation
, 1994
"... In many cases, a logic program can be divided into two parts, so that one of them, the \bottom " part, does not refer to the predicates de ned in the \top " part. The \bottom " rules can be used then for the evaluation of the predicates that they de ne, and the computed va ..."
Abstract

Cited by 294 (16 self)
 Add to MetaCart
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom " part, does not refer to the predicates de ned in the \top " part. The \bottom " rules can be used then for the evaluation of the predicates that they de ne, and the computed
A FormulaeasTypes Notion of Control
 In Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages
, 1990
"... The programming language Scheme contains the control construct call/cc that allows access to the current continuation (the current control context). This, in effect, provides Scheme with firstclass labels and jumps. We show that the wellknown formulaeastypes correspondence, which relates a constr ..."
Abstract

Cited by 294 (0 self)
 Add to MetaCart
ff holds classically, but not constructively  is illustrated by the definition of conjunctive, disjunctive, and existential types using standard classical definitions. We also prove that all evaluations of typed terms in Idealized Scheme are finite.
Outerjoins as Disjunctions
"... The outerjoin operator is currently available in the query language of several major DBMSs, and it is included in the proposed SQL2 standard draft. However, "associativity problems" of the operator have been pointed out since its introduction. In this paper we propose a shift in the int ..."
Abstract

Cited by 42 (1 self)
 Add to MetaCart
be evaluated by means of binary outerjoins, and give alternative procedures to evaluate those queries. We also explore several evaluation strategies for outerjoin queries, including the use of semijoin programs to reduce base relations. CR Subject Classification (1991): [H.2.4] Database Systems, Query
DESIGN, IMPLEMENTATION, AND EVALUATION OF THE CONSTRAINT LANGUAGE cc(FD)
 J. LOGIC PROGRAMMING 1994:19, 20:1679
, 1994
"... This paper describes the design, implementation, and applications of the constraint logic language cc(FD). cc(FD) is a declarative nondeterministic constraint logic language over finite domains based on the cc framework [33], an extension of the CLP scheme [21]. Its constraint solver includes (nonl ..."
Abstract

Cited by 187 (9 self)
 Add to MetaCart
are reported and indicate that cc(FD) comes close to procedural languages on a number of combinatorial problems. In addition, a small cc(FD) program was able to find the optimal solution and prove optimality to a famous 10/10 disjunctive scheduling problem [29], which was left open for more than 20 years
Partially disjunctive heap abstraction
 Proceedings of the 11th International Symposium, SAS 2004
, 2004
"... Abstract. One of the continuing challenges in abstract interpretation is the creation of abstractions that yield analyses that are both tractable and precise enough to prove interesting properties about realworld programs. One source of difficulty is the need to handle programs with different behav ..."
Abstract

Cited by 34 (10 self)
 Add to MetaCart
—a generic system for implementing program analyses.We conducted an empirical evaluation of the new abstraction and compared it with the powerset heap abstraction. The experiments show that analyses based on the partially disjunctive heap abstraction are as precise as the ones based on the powerset heap
Hyper Tableaux and Disjunctive Logic Programming
 FACHBERICHTE INFORMATIK 1396, UNIVERSITAT KOBLENZLANDAU, UNIVERSITAT KOBLENZLANDAU, INSTITUT FUR INFORMATIK, RHEINAU 1, D56075
, 1996
"... ... This paper proves that there exist an efficient proof procedure, namely hyper tableaux, which can be understood as a direct implementation of some of the well known fixpoint iteration techniques. We show how a hyper tableaux refutation can be transformed into a restart model elimination refutati ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
., 1996 ] . In the following two sections we compare this calculus to fixpoint iteration techniques: there is one seminal paper by Minker and Rajasekar [ Minker and Rajasekar, 1990 ] which introduces a consequence operator to define a semantics for positive disjunctive logic programs by fixpoint iteration
Disambiguating with Controlled Disjunctions
, 1997
"... We propose in this paper a disambiguating technique called controlled disjunctions. This extension of the socalled named disjunctions relies on the relations existing between feature values (covariation, control, etc.). We show that the controlled disjunctions can implement different kind of amb ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
of ambiguities in a consistent and homogeneous way. The example of the integration of controlled disjunctions into a HPSG feature structure representation is described. Finally, we present a direct implementation by means of delayed evaluation devices and we develop an example within the functionnal
Disjunctive Semantics based upon Partial and BottomUp Evaluation
 Proceedings of the 12th Int. Conf. on Logic Programming
, 1995
"... We present a new and general approach of defining semantics for disjunctive logic programs. Our framework consists of two parts: (1) a semantical , where semantics are defined in an abstract way as the weakest semantics satisfying certain properties, and (2) a procedural, namely a bottomup queryeva ..."
Abstract

Cited by 45 (12 self)
 Add to MetaCart
We present a new and general approach of defining semantics for disjunctive logic programs. Our framework consists of two parts: (1) a semantical , where semantics are defined in an abstract way as the weakest semantics satisfying certain properties, and (2) a procedural, namely a bottom
Results 1  10
of
125