Results 1  10
of
3,589
An Experimental CLP Platform for Integrity Constraints and Abduction
 In Proceedings of FQAS2000, Flexible Query Answering Systems: Advances in Soft Computing series
, 2000
"... Integrity constraint and abduction are important in queryanswering systems for enhanced query processing and for expressing knowledge in databases. A straightforward characterization of the two is given in a subset of the language CHR _ , originally intended for writing constraint solvers to be a ..."
Abstract

Cited by 39 (17 self)
 Add to MetaCart
, disjunctive databases and, as shown here, integrity constraint and abduction 1 Introduction Constraint logic programming (CLP) [10] is established as an extension to logic programming that adds higher expressibility and in some cases more efficient query evaluation. CLP has also given rise to a field
Abduction in Logic Programming
"... Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over th ..."
Abstract

Cited by 616 (76 self)
 Add to MetaCart
Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over
The DLV System for Knowledge Representation and Reasoning
 ACM Transactions on Computational Logic
, 2002
"... Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely believ ..."
Abstract

Cited by 455 (100 self)
 Add to MetaCart
language, functionfree disjunctive logic programs (also known as disjunctive datalog), extended by weak constraints, which are a powerful tool to express optimization problems. We then illustrate the usage of DLV as a tool for knowledge representation and reasoning, describing a new declarative
Interpreting Abduction in CLP
 APPIAGULPPRODE Joint Conf. on Declarative Programming, Reggio
, 2003
"... Constraint Logic Programming (CLP) and Abductive Logic Programming (ALP) share the important concept of conditional answer. We exploit their deep similarities to implement an efficient abductive solver where abducibles are treated as constraints. We propose two possible implementations, in which int ..."
Abstract
 Add to MetaCart
integrity constraints are exploited either (i) as the definition of a CLP solver on an abductive domain, or (ii) as constraints à la CLP. Both the solvers are implemented on top of CLP(Bool), that typically have impressively efficient propagation engines.
Extending and Implementing the Stable Model Semantics
, 2002
"... A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization capabilities ..."
Abstract

Cited by 395 (8 self)
 Add to MetaCart
A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization
Knowledge Engineering: Principles and Methods
, 1998
"... This paper gives an overview about the development of the field of Knowledge Engineering over the last 15 years. We discuss the paradigm shift from a transfer view to a modeling view and describe two approaches which considerably shaped research in Knowledge Engineering: Rolelimiting Methods and Ge ..."
Abstract

Cited by 349 (7 self)
 Add to MetaCart
based systems, problemsolving methods, and ontologies. We conclude with outlining the relationship of Knowledge Engineering to Software Engineering, Information Integration and Knowledge Management.
ACLP: Abductive Constraint Logic Programming
, 2000
"... This paper presents the framework of Abductive Constraint Logic Programming (ACLP), which integrates Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP). In ACLP, the task of abduction is supported and enhanced by its nontrivial integration with constraint solving. This int ..."
Abstract

Cited by 56 (5 self)
 Add to MetaCart
This paper presents the framework of Abductive Constraint Logic Programming (ACLP), which integrates Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP). In ACLP, the task of abduction is supported and enhanced by its nontrivial integration with constraint solving
ACLP: Integrating Abduction and Constraint Solving
 Journal of Logic Programming
, 2000
"... ACLP is a system which combines abductive reasoning and constraint solving by integrating the frameworks of Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP). It forms a general highlevel knowledge representation environment for abductive problems in Artificial Intelligence an ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
ACLP is a system which combines abductive reasoning and constraint solving by integrating the frameworks of Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP). It forms a general highlevel knowledge representation environment for abductive problems in Artificial Intelligence
The CIFF Proof Procedure for Abductive Logic Programming with Constraints
 In Proceedings JELIA04
, 2004
"... We introduce a new proof procedure for abductive logic programming and present two soundness results. Our procedure extends that of Fung and Kowalski by integrating abductive reasoning with constraint solving and by relaxing the restrictions on allowed inputs for which the procedure can operate ..."
Abstract

Cited by 41 (20 self)
 Add to MetaCart
We introduce a new proof procedure for abductive logic programming and present two soundness results. Our procedure extends that of Fung and Kowalski by integrating abductive reasoning with constraint solving and by relaxing the restrictions on allowed inputs for which the procedure can operate
Results 1  10
of
3,589