the proceedings contain 7 papers. the topics discussed include: a transition system for AC language algorithms;weighted-sequence problem: ASP vs CASP and declarative vs problem oriented solving;a new algorithm for P-l...
the proceedings contain 7 papers. the topics discussed include: a transition system for AC language algorithms;weighted-sequence problem: ASP vs CASP and declarative vs problem oriented solving;a new algorithm for P-log inference engine;computing stable models of logic programs using metropolis type algorithms;ASP-based problem solving with cutting-edge tools;complexity of super-coherence problems in ASP;and logic programs with intensional functions (preliminary report).
the proceedings contain 22 papers. the special focus in this conference is on Extensions of Logic programming. the topics include: Design for AKL with intelligent pruning;birkhoff's HSP-theorem for cumulative logi...
ISBN:
(纸本)9783540580256
the proceedings contain 22 papers. the special focus in this conference is on Extensions of Logic programming. the topics include: Design for AKL with intelligent pruning;birkhoff's HSP-theorem for cumulative logic programs;finite domains and exclusions as first-class citizens;some experimental results in implementing a logic language with multi-head clauses on a transputer architecture;a language with finite sets embedded in the CLP-scheme;finitary partial inductive definitions as a general logic;programming methodologies in GCLA;computing cost estimates for proof strategies;logic programming with multiple context management schemes;non-procedural logic programming;axioms in definitional calculi;regular search spaces as a foundation of logic programming;answersets and nonmonotonic s4;cut formulae and logic programming;higher-order aspects of logic programming;representation and inference with consistent temporal propositions;definitional reflection and the completion.
We propose in this article a translation from quantified Boolean formulae to answersetprogramming. the computation of a solution of a quantified Boolean formula is then equivalent to the computation of a stable mode...
We propose in this article a translation from quantified Boolean formulae to answersetprogramming. the computation of a solution of a quantified Boolean formula is then equivalent to the computation of a stable model for a normal logic program. the case of unquantified Boolean formulae is also considered since it is equivalent to the case of quantified Boolean formulae with only existential quantifiers.
Ontologies are pervading many areas of knowledge representation and management. To date, most research efforts have been spent on the development of sufficiently expressive languages for the representation and queryin...
详细信息
Ontologies are pervading many areas of knowledge representation and management. To date, most research efforts have been spent on the development of sufficiently expressive languages for the representation and querying of ontologies;however, querying efficiency has received attention only recently, especially for ontologies referring to large amounts of data. In fact, it is still uncertain how reasoning tasks will scale when applied on massive amounts of data. this work is a first step toward this setting: it first shows that Resource Description Framework(Schema) [RDF(S)] ontologies can be expressed, without loss of semantics, into answersetprogramming (ASP). then, based on a previous result showing that the SPARQL query language (a candidate W3C recommendation for RDF(S) ontologies) can be mapped to a rule-based language, it shows that efficient querying of big ontologies can be accomplished with a database oriented extension of the well known ASP system DLV, which we recently developed. Results reported in the article show that our proposed framework is promising for the improvement of both scalability and expressiveness of available RDF(S) storage and query systems.
We propose in this article a translation from quantified Boolean formulae to answersetprogramming. the computation of a solution of a quantified Boolean formula is then equivalent to the computation of a stable mode...
详细信息
We propose in this article a translation from quantified Boolean formulae to answersetprogramming. the computation of a solution of a quantified Boolean formula is then equivalent to the computation of a stable model for a normal logic program. the case of unquantified Boolean formulae is also considered since it is equivalent to the case of quantified Boolean formulae with only existential quantifiers.
Implementation costs linked to processor memory subsystems (cache miss costs, stalls due to bandwidth limits, etc.) have been shown to be a factor in the performance of a variety of declarative programming tools. this...
详细信息
Implementation costs linked to processor memory subsystems (cache miss costs, stalls due to bandwidth limits, etc.) have been shown to be a factor in the performance of a variety of declarative programming tools. this article investigates their impact on answerset solvers and the factors that control them. Experiments independently altering the size and difficulty of input programs allow a qualitative assessment of whether input program or solver design is a greater factor and a quantitative assessment of how much of problem these issues create.A variety of processor performance metrics are recorded and used to provide a detailed picture of what limits solver performance and dispel a number of common *** demonstrate the degree to which these problems can be addressed, smodels-ie is presented. this is a version of the smodels solver with a number of implementation changes to improve cache utilisation, one major aspect of memory costs.
answersetprogramming (ASP) does not allow for incrementally constructing answersets or locally validating constructions like proofs by only looking at a part of the given program. In this article, we elaborate upon...
详细信息
answersetprogramming (ASP) does not allow for incrementally constructing answersets or locally validating constructions like proofs by only looking at a part of the given program. In this article, we elaborate upon an alternative approach to ASP that allows for incremental constructions. Our approach draws its basic intuitions from the area of default logics. We investigate the feasibility of the concept of semi-monotonicity known from default logics as a basis of incrementality. On the one hand, every logic program has at least one answerset in our alternative setting, which moreover can be constructed incrementally based on generating rules. On the other hand, the approach may produce answersets lacking characteristic properties of standard answersets, such as being a model of the given program. We show how integrity constraints can be used to re-establish such properties, even up to correspondence with standard answersets. Furthermore, we develop an SLD-like proof procedure for our incremental approach to ASP, which allows for query-oriented computations. Also, we provide a characterization of our definition of answersets via a modification of Clarks completion. Based on this notion of program completion, we present an algorithm for computing the answersets of a logic program in our approach.
Adapting techniques from database theory in order to optimize answersetprogramming (ASP) systems, and in particular the grounding components of ASP systems, is an important topic in ASP. In recent years, the Magic S...
详细信息
the goal of this article is to foster modular program development in answersetprogramming using a Gaifman-Shapiro-style module architecture. More specifically, a method for verifying the equivalence of logic program...
详细信息
the goal of this article is to foster modular program development in answersetprogramming using a Gaifman-Shapiro-style module architecture. More specifically, a method for verifying the equivalence of logic program modules is devised and proved correct. the idea is to adapt a translation-based verification technique, which was originally devised for complete programs only, for program modules. In addition, optimization strategies are addressed in order to exploit the modular structure of programs in verification tasks. A number of experiments on verification strategies are also conducted using lpeq which implements the verification method for the smodels system. the preliminary experimental results reported in this article suggest that the modularization of equivalence verification leads to potential time savings especially if the modules involved share a common context.
We investigate the use of multilattices as the set of truth-values underlying a general fuzzy logic programming framework. On the one hand, some theoretical results about ideals of a multilattice are presented in orde...
详细信息
We investigate the use of multilattices as the set of truth-values underlying a general fuzzy logic programming framework. On the one hand, some theoretical results about ideals of a multilattice are presented in order to provide an ideal-based semantics;on the other hand, a restricted semantics, in which interpretations assign elements of a multilattice to each propositional symbol, is presented and analysed. (C) 2006 Elsevier B.V. All rights reserved.
暂无评论