Constraint functional programming (CEP) is presented as a new declarative programming paradigm. A CFP system is an integrated declarative programming system in which functional programming can be achieved by evaluatin...
详细信息
Constraint functional programming (CEP) is presented as a new declarative programming paradigm. A CFP system is an integrated declarative programming system in which functional programming can be achieved by evaluating expressions on the computational domains. At the same time, logicprogramming can also be achieved by solving constraints over these domains. CFP is developed from the notion of absolute set abstraction, a language construct in functional languages acting as the 'logicprogramming facility'. CFP systematically unifies functional programming and logicprogramming from a fundamental semantic level and is expected to provide great expressive power. Problem solving in CFP is directly performed on the intended domain of discourse. this property also allows some algorithmic constraint solving techniques to be exploited and restricts the search space in the computation to make the system efficient.
In this paper, we try to establish connections between three different fields, which are mathematical morphology, order filters, and fuzzy logic. It is found that strong similarities between them exist, with respect t...
详细信息
ISBN:
(纸本)0780324625
In this paper, we try to establish connections between three different fields, which are mathematical morphology, order filters, and fuzzy logic. It is found that strong similarities between them exist, with respect to their algebraic structure, and tools which are common in fuzzy logic appear to be particular cases of some concepts of mathematical morphology, and are generalization of order filters. We give as an illustration an example of application on real images.
Recently a logicprogramming language AC was proposed by Mellarkod et al. (2008) to integrate answer set programming (ASP) and constraint logicprogramming. In a similar vein, Gebser et al. (2009) proposed a clingcon ...
详细信息
this paper introduces a language and framework for designing multiprocessor architectures in the logicprogramming domain. Our goal is to enable application developers in areas such as machine learning and cognitive r...
详细信息
ISBN:
(纸本)0780394070
this paper introduces a language and framework for designing multiprocessor architectures in the logicprogramming domain. Our goal is to enable application developers in areas such as machine learning and cognitive robotics to produce high-performance designs without detailed knowledge of hardware development. this framework provides a high level of abstraction, enabling rapid system generation and design space exploration while supporting high performance. We present an overview of the Archlog language and its library-based compilation framework, which makes use of a customisable logicprogramming processor An example implementation of a multiprocessor for the machine learning system Progol on a 35MHz XC2V6000 FPGA achieves 43 times faster execution than a 2GHz Pentium 4 processor.
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.
the proceedings contain 22 papers. the special focus in this conference is on Extensions of logicprogramming. 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 logicprogramming. 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;logicprogramming with multiple context management schemes;non-procedural logicprogramming;axioms in definitional calculi;regular search spaces as a foundation of logicprogramming;answer sets and nonmonotonic s4;cut formulae and logicprogramming;higher-order aspects of logicprogramming;representation and inference with consistent temporal propositions;definitional reflection and the completion.
the proceedings contain 50 papers. the special focus in this conference is on Graph Grammars and their Application to Computer Science. the topics include: A note on hyperedge replacement;graph grsmmars based on node ...
ISBN:
(纸本)9783540544784
the proceedings contain 50 papers. the special focus in this conference is on Graph Grammars and their Application to Computer Science. the topics include: A note on hyperedge replacement;graph grsmmars based on node rewriting: an introduction to NLC graph grammars;tutorial introduction to the algebraic approach of graph grammars based on double and single pushouts;the logical expression of graph properties (abstract);the use of graph grammars in applications;an interactive tool for developing graph grammars;an integrated and incremental project support environment;a text-oriented hybrid editor for programmed graph rewriting systems;tools for analyzing graph grammars;an algebraictheory of graph reduction;programming with very large graphs;general solution to a system of recursive equations on hypergraphs;contruction of map OL-systems for developmental sequences of plant cell layers;cycle chain code picture languages;an efficient implementation of graph grammars based on the RETE matching algorithm;an application of graph grammars to the elimination of redundancy from functions defined by schemes;graphic equivalence and computer optimization;graph grammars and logicprogramming;an algebraic and logical approach;context-free handle-rewriting hypergraph grammars;from graph grammars to high level replacement systems;a characterization of context-free NCE graph languages by monadic second-order logic on trees;elementary actions on an extended entity-relationship database;collage grammars;structured transformations and computation graphs for actor grammars;grammatical inference based on hyperedge replacement;graph rewriting in some categories of partial morphisms.
Birkhoff’s HSP theorem is that the models of a set of algebraic equations form a variety, i.e. a category of algebras which admits homomorphic images, subalgebras and products. We show here first, that every equation...
详细信息
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.
In object-oriented representation, inheritance determines the attributes of a given object, given its type. Conversely, recognition determines the type of an object, given its attributes. In this paper, we address the...
详细信息
ISBN:
(纸本)0818628308
In object-oriented representation, inheritance determines the attributes of a given object, given its type. Conversely, recognition determines the type of an object, given its attributes. In this paper, we address the more general problem of recognition from constraints;we argue that it can be seen as a special case of the classical abduction process and that it can be implemented as an abduction operation on constraints. Abductive reasoning is common is most fields of artificial intelligence. Constraint logicprogramming (CLP) generalizes logicprogramming by replacing unification with Constraint Solving. We first explore the relationship between Abduction and CLP and show that CLP is a special case of abduction. A class of problems is then identified for which the usual unrestricted forms of abduction are unsuitable. Within the CLP framework a restricted form of abduction is formulated which is applicable to the whole class of problems, in which object-oriented recognition can be considered as a special case.
暂无评论