Propagation based finite domain solvers provide a general mechanism for solving combinatorial problems. Different propagation methods can be used in conjunction by communicating through the do- mains of shared variabl...
详细信息
the proceedings contain 34 papers. the special focus in this conference is on logicprogramming and Nonmonotonic Reasoning. the topics include: Strong and weak constraints in disjunctive datalog;non-monotonic reasonin...
ISBN:
(纸本)9783540632559
the proceedings contain 34 papers. the special focus in this conference is on logicprogramming and Nonmonotonic Reasoning. the topics include: Strong and weak constraints in disjunctive datalog;non-monotonic reasoning with quantified Boolean constraints;complexity of only knowing;affordable classes of normal logic programs;automated reasoning with non-monotonic logics;simulations between programs as cellular automata;separating disbeliefs from beliefs in autoepistemic reasoning;resolution for skeptical stable semantics;computing non-ground representations of stable models;industry needs for integrated information services;towards a systematic approach to representing knowledge in declarative logicprogramming;a paraconsistent semantics with contradiction support detection;a general framework for revising non-monotonic theories;modular logicprogramming and generalized quantifiers;programs with universally quantified embedded implications;generalized query answering in disjunctive deductive databases;towards a disjunctive logicprogramming system;a deductive system for non-monotonic reasoning;flexible solutions to complex problems;an implementation of the stable model and well-founded semantics for normal lp;an implementation platform for query-answering in default logics and the x-ray system, its implementation and evaluation.
作者：
Higuchi, TAoki, TTohoku Univ
Grad Sch Informat Sci Dept Syst Informat Sci Aoba Ku Sendai Miyagi 9808579 Japan
this paper presents the concept of multiplex computing as a foundation for next-generation integrated systems free from interconnection problems. Computing with multiplexable information carriers makes it possible to ...
详细信息
this paper presents the concept of multiplex computing as a foundation for next-generation integrated systems free from interconnection problems. Computing with multiplexable information carriers makes it possible to achieve highly parallel processing with reduced interconnections. A unified algebraic framework for set-valued logic, in which a collection of information carriers on a single line is treated as a set-valued signal, is proposed for the systematic synthesis of multiplex-computing circuits. Also, possible approaches to implementations are discussed. (C) 1998 Elsevier Science Ltd. All rights reserved.
this paper gives a brief high-level description of the implementation of a disjunctive logicprogramming system referred to as DisLoP. this system is a result of research activities of the Disjunctive logic Programmin...
详细信息
ISBN:
(纸本)3540632557
this paper gives a brief high-level description of the implementation of a disjunctive logicprogramming system referred to as DisLoP. this system is a result of research activities of the Disjunctive logicprogramming-project (funded by Deutsche Forschungs-Gemeinschaft), undertaken by the University of Koblenz since July 1995.
the program composition approach can be fruitfully applied to combine general logic programs, i.e, logic programs possibly containing negative premises. We show how the introduction of a basic set of (meta-level) comp...
详细信息
ISBN:
(纸本)3540632557
the program composition approach can be fruitfully applied to combine general logic programs, i.e, logic programs possibly containing negative premises. We show how the introduction of a basic set of (meta-level) composition operations over general programs increases the knowledge representation capabilities of logicprogramming for non-monotonic reasoning. Examples of modular programming, hierarchical reasoning, constraints, and rules with exceptions will be illustrated. the semantics of programs and program compositions is defined in terms of three-valued logic [15]. the computational interpretation of program compositions is formalised by an equivalence preserving syntactic transformation of arbitrary program compositions into standard general programs.
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations studied by BRASS and DIX [4, 5]. the tra...
详细信息
ISBN:
(纸本)3540632557
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations studied by BRASS and DIX [4, 5]. the transformation approach has been introduced in more detail in [7]. In this paper we present a deeper analysis of its complexity and describe an optimized SCC-oriented evaluation. We show that by our method no more work is done than by the alternating fixpoint procedure [23, 24] and that there are examples where our algorithm is significantly superior.
Several methods to compute the prime implicants and the prime implicates of a negation normal form (NNF) formula are developed and implemented. An algorithm PI is introduced that is an extension to negation normal for...
详细信息
Several methods to compute the prime implicants and the prime implicates of a negation normal form (NNF) formula are developed and implemented. An algorithm PI is introduced that is an extension to negation normal form of an algorithm given by Jackson and Pais. ir. correctness proof of the PI algorithm is given. the PI algorithm alone is sufficient in a computational sense, However, it can be combined with path dissolution, and it is shown empirically that this is often an advantage. None of these variations rely on conjunct ive normal form or on disjunctive normal form. A class of formulas is described for which reliance on CNF or on DNF results in ar. exponential increase in the time required to compute prime implicants/implicates. the possibility of avoiding this problem with efficient structure preserving clause form translations is examined briefly and appears unfavorable.
the proceedings contain 33 papers. the special focus in this conference is on Static Analysis. the topics include: On sparse evaluation representations;the effects of the precision of pointer analysis;fast and effecti...
ISBN:
(纸本)9783540634683
the proceedings contain 33 papers. the special focus in this conference is on Static Analysis. the topics include: On sparse evaluation representations;the effects of the precision of pointer analysis;fast and effective procedure inlining;set-sharing is redundant for pair-sharing;an algebraic approach to sharing analysis of logic programs;logical optimality of groundness analysis;towards a cost-effective estimation of uncaught exceptions in SML programs;program analysis using mixed term and set constraints;set-based analysis for logicprogramming and tree automata;denotational abstract interpretation of functional logic programs;termination analysis for mercury;type-based analysis of communication for concurrent programming languages;true concurrency via abstract interpretation;static analysis of interaction nets for distributed implementations;type-directed flow analysis for typed intermediate languages;exact flow analysis;satisfying subtype inequalities in polynomial space;effective specialization of realistic programs via use sensitivity;coalescing conditional branches into efficient indirect jumps;automatic termination analysis for partial functions using polynomial orderings;automatically proving termination of programs in a non-strict higher-order functional language;semantic analyzer of modula-programs;abstract interpretation for improving wam code;attribute grammars and functional programming deforestation;data dependences as abstract interpretations;abstract interpretation based static analysis parameterized by semantics and practical compile-time analysis.
A general framework for revision of nonmonotonic theories is presented. this framework can be applied if the intended nonmonotonic semantics is not (weakly) cumulative. For weaker-semantics, it is shown that revision ...
详细信息
ISBN:
(纸本)3540632557
A general framework for revision of nonmonotonic theories is presented. this framework can be applied if the intended nonmonotonic semantics is not (weakly) cumulative. For weaker-semantics, it is shown that revision by contraction is not possible whenever the intended semantics satisfies Weak Cut and revision by expansion fails whenever Weak (Cautious) Monotony fails. Furthermore, it turns out that revision by expansion can be used to test whether the framework can be applied successfully and we analyse the case for logicprogramming.
暂无评论