Results 1  10
of
149
The KR System dlv: Progress Report, Comparisons and Benchmarks
, 1998
"... dlv is a knowledge representation system, based on disjunctive logic programming, which offers frontends to several advanced KR formalisms. The system has ..."
Abstract

Cited by 120 (23 self)
 Add to MetaCart
dlv is a knowledge representation system, based on disjunctive logic programming, which offers frontends to several advanced KR formalisms. The system has
Clone detection in source code by frequent itemset techniques
 In SCAM
, 2004
"... wahler,seipel,wolff,fischer¡ In this paper we describe a new approach for the detection of clones in source code, which is inspired by the concept of frequent itemsets from data mining. The source code is represented as an abstract syntax tree in XML; we can use different kinds of XML–languages for ..."
Abstract

Cited by 36 (0 self)
 Add to MetaCart
wahler,seipel,wolff,fischer¡ In this paper we describe a new approach for the detection of clones in source code, which is inspired by the concept of frequent itemsets from data mining. The source code is represented as an abstract syntax tree in XML; we can use different kinds of XML
Disjunctive Logic Programming: A Survey And Assessment
, 2002
"... We describe the elds of disjunctive logic programming and disjunctive deductive databases from the time of their inception to the current time. Contributions with respect to semantics, implementations and applications are surveyed. ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
We describe the elds of disjunctive logic programming and disjunctive deductive databases from the time of their inception to the current time. Contributions with respect to semantics, implementations and applications are surveyed.
Using Clausal Deductive Databases for De ning Semantics in Disjunctive Deductive Databases
, 2001
"... This paper investigates the novel concept of clausal deductive databases (cd{ databases), which are special normal deductive databases { i.e. deductive databases which may contain default negation in rule bodies { over a meta{language L with a xed set of predicate symbols, namely dis, con, and ..."
Abstract
 Add to MetaCart
This paper investigates the novel concept of clausal deductive databases (cd{ databases), which are special normal deductive databases { i.e. deductive databases which may contain default negation in rule bodies { over a meta{language L with a xed set of predicate symbols, namely dis, con, and some built{in predicate symbols
Finite set constraints in Oz
 TECHNISCHE UNIVERSITÄT MÜNCHEN
, 1997
"... We report on the extension of the concurrent constraint language Oz by constraints over finite sets of integers. Set constraints are an important addition to the constraint programming system Oz and are very employable in natural language processing and general problem solving. This extension profit ..."
Abstract

Cited by 26 (4 self)
 Add to MetaCart
We report on the extension of the concurrent constraint language Oz by constraints over finite sets of integers. Set constraints are an important addition to the constraint programming system Oz and are very employable in natural language processing and general problem solving. This extension profits much from its integration with the existing constraint systems over finite domains and feature trees, as well as from the availability of firstclass procedures. This combination of features is unique to Oz. This paper focuses on the expressiveness gained by set constraints and on the benefits of the integration with finite domain constraints. A number of case studies demonstrates programming techniques exploring these advantages.
Model Generation and State Generation for Disjunctive Logic Programs
, 1995
"... This paper investigates two fixpoint approaches for minimal model reasoning with disjunctive logic programs P. The first one, called model generation [4], is based on an operator T INT P defined on sets of Herbrand interpretations, whose least fixpoint is logically equivalent to the set of minima ..."
Abstract

Cited by 25 (10 self)
 Add to MetaCart
This paper investigates two fixpoint approaches for minimal model reasoning with disjunctive logic programs P. The first one, called model generation [4], is based on an operator T INT P defined on sets of Herbrand interpretations, whose least fixpoint is logically equivalent to the set of minimal Herbrand models of the program. The second approach, called state generation [12], uses a fixpoint operator T s P based on hyperresolution. It operates on disjunctive Herbrand states and its least fixpoint is the set of logical consequences of P, the socalled minimal model state of the program. We establish a useful relationship between hyperresolution by T s P and model generation by T INT P . Then we investigate the problem of continuity of the two operators T s P and T INT P . It is known that the operator T s P is continuous [12], and so it reaches its least fixpoint in at most ! steps. On the other hand, the question of whether T INT P is continuous has been open. ...
Incremental Development of Diagnostic SetCovering Models with Therapy Effects
, 2001
"... We will consider setcovering models for diagnostic tasks handling uncertain knowledge. Because these models have to be build manually by domain experts, we will show how this effort can be reduced by an incremental development of the setcovering models. Thus simple models can be enhanced by simil ..."
Abstract

Cited by 19 (15 self)
 Add to MetaCart
We will consider setcovering models for diagnostic tasks handling uncertain knowledge. Because these models have to be build manually by domain experts, we will show how this effort can be reduced by an incremental development of the setcovering models. Thus simple models can be enhanced by similarities, weights and uncertainty to increase the quality of the knowledge and the resulting system.
DisLog  A System for Reasoning in Disjunctive Deductive Databases
 Proc. Intl. Workshop on the Deductive Approach to Information Systems and Databases
, 1994
"... DisLog is a system for reasoning in disjunctive deductive databases. It seeks to combine features of disjunctive logic programming, such as the support for incomplete information, with those of deductive databases, such as allresult inference capabilities. Several basic operators are provided for ..."
Abstract

Cited by 20 (6 self)
 Add to MetaCart
DisLog is a system for reasoning in disjunctive deductive databases. It seeks to combine features of disjunctive logic programming, such as the support for incomplete information, with those of deductive databases, such as allresult inference capabilities. Several basic operators are provided for logical and nonmonotonic reasoning: The logical consequence operator derives all logically implied disjunctive clauses from a disjunctive logic program. The non monotonic operators are semantically founded on generalizations of the well known closedworldassumption. Reasoning in disjunctive deductive databases is very complex, even for small examples. Many different optimization techniques are integrated in DisLog to speed up the application performance. The main techniques rely on a clause tree data structure allowing for an efficient and transparent evaluation. The operators of DisLog can be loaded from a library into a Prolog application. DisLog itself is implemented as a metai...
DISLOG  A Disjunctive Deductive Database Prototype
 PROC. TWELFTH WORKSHOP ON LOGIC PROGRAMMING (WLP'97
, 1997
"... DISLOG is a system for reasoning in disjunctive deductive databases. It seeks to combine features of disjunctive logic programming, such as the support for incomplete information, with those of deductive databases, such as allresult inference capabilities. Several basic operators are provided for ..."
Abstract

Cited by 14 (11 self)
 Add to MetaCart
DISLOG is a system for reasoning in disjunctive deductive databases. It seeks to combine features of disjunctive logic programming, such as the support for incomplete information, with those of deductive databases, such as allresult inference capabilities. Several basic operators are provided for logical and nonmonotonic reasoning: The logical consequence operator derives all logically implied disjunctive clauses from a disjunctive database. The nonmonotonic operators are semantically founded on generalizations of the wellknown closedworldassumption and the negationasfailure concept. Reasoning in disjunctive deductive databases is very complex, even for small examples. Many different optimization techniques are integrated in DISLOG to speed up the application performance. The clause tree is used as a data structure that allows for an efficient and transparent evaluation. The DISLOGsystem has been developed in PROLOG  currently a core part of DISLOG is reimplemented ...
Clausal Deductive Databases and a General Framework for Semantics in Disjunctive Deductive Databases
 In Proc. of the International Symposium on Foundations of Information and Knowledge Systems (FoIKS'2000), Springer, LNCS 1762
, 2000
"... In this paper we will investigate the novel concept of clausal deductive databases (cd{databases), which are special normal deductive databases { i.e. deductive databases which may contain default negation in rule bodies { over a meta{language L with a xed set of predicate symbols, namely di ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In this paper we will investigate the novel concept of clausal deductive databases (cd{databases), which are special normal deductive databases { i.e. deductive databases which may contain default negation in rule bodies { over a meta{language L with a xed set of predicate symbols, namely dis, con, and some built{in predicate symbols. The arguments of the literals in L are given by disjunctive and conjunctive clauses of a basic rst{order language L (which are considered as terms in L ). On the other hand, disjunctive deductive databases (dd{databases) extend normal deductive databases by allowing for disjunctions (rather than just single atoms or literals) in rule heads { next to default negation in rule bodies.
Results 1  10
of
149