Today, there exist many different probabilistic programming languages as well as more inference mechanisms for these languages. Still, most logicprogramming-based languages use backward reasoning based on Selective L...
详细信息
Today, there exist many different probabilistic programming languages as well as more inference mechanisms for these languages. Still, most logicprogramming-based languages use backward reasoning based on Selective Linear Definite resolution for inference. While these methods are typically computationally efficient, they often can neither handle infinite and/or continuous distributions nor evidence. To overcome these limitations, we introduce distributional clauses, a variation and extension of Sato's distribution semantics. We also contribute a novel approximate inference method that integrates forward reasoning with importance sampling, a well-known technique for probabilistic inference. In order to achieve efficiency, we integrate two logicprogramming techniques to direct forward sampling. Magic sets are used to focus on relevant parts of the program, while the integration of backward reasoning allows one to identify and avoid regions of the sample space that are inconsistent withthe evidence.
We present a procedure for deciding (database) query containment under constraints. the technique is to extend the logic DLR with an ABox, and to transform query subsumption problems into DLR ABox satisfiability probl...
详细信息
ISBN:
(纸本)3540412859
We present a procedure for deciding (database) query containment under constraints. the technique is to extend the logic DLR with an ABox, and to transform query subsumption problems into DLR ABox satisfiability problems. Such problems can then be decided, via a reification transformation, using a highly optimised reasoner for the SHIQ description logic. We use a simple example to support our hypothesis that this procedure will work well with realistic problems.
the paper provides a new approach for automatedreasoning in a logic Program using extended Petri net models. the design includes extension of classical linear resolution of first order logic clauses by multi-resoluti...
详细信息
ISBN:
(纸本)0769530508
the paper provides a new approach for automatedreasoning in a logic Program using extended Petri net models. the design includes extension of classical linear resolution of first order logic clauses by multi-resolution, where a set of clauses can be resolved concurrently without sacrificing any inference, thereby speeding-up the execution of the logic program. the speed-tip and utilization rate of resources are used as the performance evaluation metric to compare the performance of the proposed system withthe classical one.
While several BDI logics have been proposed in the area of Agent programming, it is not clear how these logics are connected to the agent programs they are supposed to specify. More yet, the reasoning problems in thes...
详细信息
ISBN:
(纸本)9781538680230
While several BDI logics have been proposed in the area of Agent programming, it is not clear how these logics are connected to the agent programs they are supposed to specify. More yet, the reasoning problems in these logics, being based on modal logic, are not tractable in general, limiting their usage to tackle real-world problems. In this work, we use of Dynamic Preference logic to provide a semantic foundation to BDI agent programming languages and investigate tractable expressive fragments of this logic to reason about agent programs. Withthat, we aim to provide a way of implementing semantically grounded agent programming languages with tractable reasoning cycles.
this paper introduces a novel approach for the specialization of functional logic languages. We consider a maximally simplified abstract representation of programs (which still contains all the necessary information) ...
详细信息
ISBN:
(纸本)3540412859
this paper introduces a novel approach for the specialization of functional logic languages. We consider a maximally simplified abstract representation of programs (which still contains all the necessary information) and define a non-standard semantics for these programs. Boththings mixed together allow us to design a simple and concise partial evaluation method for modern functional logic languages, avoiding several limitations of previous approaches. Moreover, since these languages can be automatically translated into the abstract representation, our technique is widely applicable. In order to assess the practicality of our approach, we have developed a partial evaluation tool for the multi-paradigm language Curry. the partial evaluator is written in Curry itself and has been tested on an extensive benchmark suite (even a meta-interpreter). To the best of our knowledge, this is the first purely declarative partial evaluator for a functional logic language.
We certify in the proof assistant Isabelle/HOL the soundness of a declarative first-order prover with equality. the LCF-style prover is a translation we have made, to Standard ML, of a prover in John Harrison's Ha...
详细信息
We certify in the proof assistant Isabelle/HOL the soundness of a declarative first-order prover with equality. the LCF-style prover is a translation we have made, to Standard ML, of a prover in John Harrison's Handbook of Practical logic and automatedreasoning. We certify it by replacing its kernel with a certified version that we program, certify and generate code from;all in Isabelle/HOL. In a declarative proof each step of the proof is declared, similar to the sentences in a thorough paper proof. the prover allows proofs to mix the declarative style with automatic theorem proving by using a tableau prover. Our motivation is teaching how automated and declarative provers work and how they are used. the prover allows studying concrete code and a formal verification of correctness. We show examples of proofs and how they are made in the prover. the entire development runs in Isabelle's ML environment as an interactive application or can be used standalone in OCaml or Standard ML (or in other functional programming languages like Haskell and Scala with some additional work).
We give a logicprogramming based account of probability and describe a declarative language P-log capable of reasoning which combines bothlogical and probabilistic arguments. Several non-trivial examples illustrate ...
详细信息
ISBN:
(纸本)354020721X
We give a logicprogramming based account of probability and describe a declarative language P-log capable of reasoning which combines bothlogical and probabilistic arguments. Several non-trivial examples illustrate the use of P-log for knowledge representation.
Guarded logics are fragments of first-order logic, fixed point logic or second-order logic in which all quantifiers are relativised by guard formulae in an appropriate way. Semantically, this means that such logics ca...
详细信息
ISBN:
(纸本)3540412859
Guarded logics are fragments of first-order logic, fixed point logic or second-order logic in which all quantifiers are relativised by guard formulae in an appropriate way. Semantically, this means that such logics can simultaneously refer to a collection of elements only if all these elements are ‘close together’ (e.g. coexist in some atomic fact). Guarded logics are powerful generalizations of modal logics (such as propositional multi-modal logic or the modal μ-calculus) that retain and, to a certain extent, explain their good algorithmic and model-theoretic properties. In this talk, I will survey the recent research on guarded logics. I will also present a guarded variant of Datalog, called Datalog LITE, which is semantically equivalent to the alternation-free portion of guarded fixed point logic. the main focus of the talk will be on model checking (or equivalently, query evaluation) algorithms for guarded *** the complexity of evaluating arbitrary guarded fixed point formulae is closely related to the model checking problem for the modal μ-calculus (for which no polynomial-time algorithms are known up to now), there are interesting fragments that admit efficient, in fact linear time, evaluation algorithms. In particular this is the case for the guarded fragment of first-order logic and for Datalog LITE.
Codatatypes are absent from many programming and specification languages. We make a case for their importance by revisiting a classical result: the completeness theorem for first-order logic established through a Gent...
详细信息
ISBN:
(纸本)9783319085876;9783319085869
Codatatypes are absent from many programming and specification languages. We make a case for their importance by revisiting a classical result: the completeness theorem for first-order logic established through a Gentzen system. the core of the proof establishes an abstract property of possibly infinite derivation trees, independently of the concrete syntax or inference rules. this separation of concerns simplifies the presentation. the abstract proof can be instantiated for a wide range of Gentzen and tableau systems as well as various flavors of first-order logic. the corresponding Isabelle/HOL formalization demonstrates the recently introduced support for codatatypes and the Haskell code generator.
In this paper, we address the problem of checking whether two disjunctive logic programs possess exactly the same stable models. An existing translation-based method [14], which was designed for weight constraint prog...
详细信息
ISBN:
(纸本)354020721X
In this paper, we address the problem of checking whether two disjunctive logic programs possess exactly the same stable models. An existing translation-based method [14], which was designed for weight constraint programs supported by the SMODELS system, is generalized to the disjunctive case. Moreover, we report on our preliminary experiments with an implementation of the method, a translator called DLPEQ.
暂无评论