Parallel programming methodology in GHC is discussed based on our experience in programming a proof procedure of temporal logic. It is said that GHC can express basic constructs of parallel processing such as communic...
详细信息
Anewmethod to implement threshold logic functions using memristors is presented. this method benefits from the high range of memristor's resistivity, which is used to define different weight values, and reduces si...
详细信息
Anewmethod to implement threshold logic functions using memristors is presented. this method benefits from the high range of memristor's resistivity, which is used to define different weight values, and reduces significantly the transistor count. When considering an upper bound on transistor count, the proposed approach implements many more functions as threshold logic gates when comparing to existing implementations. Experimental results in 45-nm technology show that the proposed memristive approach implements threshold logic gates with less area and power consumption.
We present a procedure for partial deduction of logic programs, based on an automatic unfolding algorithm which guarantees the construction of sensibly and strongly expanded, finite SLD-trees. We prove that the partia...
详细信息
We present a procedure for partial deduction of logic programs, based on an automatic unfolding algorithm which guarantees the construction of sensibly and strongly expanded, finite SLD-trees. We prove that the partial deduction procedure terminates for all definite logic programs and queries. We show that the resulting program satisfies important soundness and completeness criteria with respect to the original program, while retaining the essentially desired amount of specialisation.
the specification and derivation of substitution for the de Bruijn representation of h-terms is used to illustrate programming with a function-sequence monad. the resulting program is improved by interactive program t...
详细信息
the specification and derivation of substitution for the de Bruijn representation of h-terms is used to illustrate programming with a function-sequence monad. the resulting program is improved by interactive program transformation methods into an efficient implementation that uses primitive machine arithmetic. these transformations illustrate new techniques that assist the discovery of the arithmetic structure of the solution.
Probabilistic logicprogramming combines logic and probability, so as to obtain a rich modeling language. In this work, we extend PROBLOG, a popular probabilistic logicprogramming language, with new constructs that a...
详细信息
ISBN:
(纸本)9781509035663
Probabilistic logicprogramming combines logic and probability, so as to obtain a rich modeling language. In this work, we extend PROBLOG, a popular probabilistic logicprogramming language, with new constructs that allow the representation of (infinite-horizon) Markov decision processes. this new language can represent relational statements, including symmetric and transitive definitions, an advantage over other planning domain languages such as RDDL. We show how to exploit the logic structure in the language to perform Value Iteration. Preliminary experiments demonstrate the effectiveness of our framework.
this paper presents a theoretical foundation of reasoning by analogy between logic programs. We give a formal definition of reasoning by analogy in terms of logicprogramming. We also introduce a notion of analogical ...
详细信息
In this paper we introduce revision programming - a logic-based framework for describing constraints on databases and providing a computational mechanism to enforce them. Revision programming captures those constraint...
In this paper we introduce revision programming - a logic-based framework for describing constraints on databases and providing a computational mechanism to enforce them. Revision programming captures those constraints that can be stated in terms of the membership (presence or absence) of items (records) in a database. Each such constraint is represented by a revision rule alpha <-- alpha(1),...,alpha(k), where alpha and all alpha(i) are of the form in(a) and out(b). Collections of revision rules form revision programs. Similarly as logic programs, revision programs admit both declarative and imperative (procedural) interpretations. In our paper, we introduce a semantics that reflects both interpretations. Given a revision program, this semantics assigns to any database B a collection (possibly empty) of P-justified revisions of B. the paper contains a thorough study of revision programming. We exhibit several fundamental properties of revision programming. We study the relationship of revision programming to logicprogramming. We investigate complexity of reasoning with revision programs as well as algorithms to compute P-justified revisions. Most importantly from the practical database perspective, we identify two classes of revision programs, safe and stratified, with a desirable property that they determine for each initial database a unique revision.
We introduce a constraint system called FT. this system offers a theoretical and practical alternative to the usual Herbrand system of constraints over constructor trees. Like Herbrand, FT provides a universal data st...
详细信息
We introduce a constraint system called FT. this system offers a theoretical and practical alternative to the usual Herbrand system of constraints over constructor trees. Like Herbrand, FT provides a universal data structure based on trees. However, the trees of FT (called feature trees) are more general than the constructor trees of Herbrand, and the constraints of FT are of finer grain and of different expressiveness. the essential novelty of FT is provided by functional attributes called features which allow representing data as extensible records, a more flexible way than that offered by Herbrand's fixed arity constructors. the feature tree structure determines an algebraic semantics for FT. We establish a logical semantics, thanks to three axiom schemes presenting the first-order theory FT. We propose using FT as a constraint system for logicprogramming. We provide a test for constraint unsatisfiability, and a test for constraint entailment. the former corresponds to unification and the latter to matching. the combination of the two is needed for advanced control mechanisms. We use the concept of relative simplification of constraints, a normalization process that decides entailment and unsatisfiability simultaneously. the two major technical contributions of this work are: (i) an incremental system performing relative simplification for FT that we prove to be sound and complete;and (ii) a proof showing that FT satisfies independence of negative constraints, the property that conjoined negative constraints may be handled independently.
Recently there has been increased interest in logicprogramming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, default reasoning is modelled by rules and ...
详细信息
ISBN:
(纸本)3540667490
Recently there has been increased interest in logicprogramming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, default reasoning is modelled by rules and a priority relation among them. Historically the first logic in this class was Defeasible logic. In this paper we will study its relationship to other approaches which also rely on the idea of using logic rules and priorities. In particular we will study sceptical LPwNF, courteous logic programs, and priority logic.
暂无评论