the proceedings contain 21 papers. the topics discussed include: novel techniques in datalog optimization;certain answers of extensions of conjunctive queries by datalog and first-order rewriting;querying data exchang...
the proceedings contain 21 papers. the topics discussed include: novel techniques in datalog optimization;certain answers of extensions of conjunctive queries by datalog and first-order rewriting;querying data exchange settings beyond positive queries;new perspectives for fuzzy datalog;model checking verification of multilayer perceptrons in datalog: a many-valued approach with typicality;towards bridging traditional and smart contracts with datalog-based languages;datalog-based reasoning with heuristics over knowledge graphs;a rule-based constraint language for event streams;a formal comparison between datalog-based languages for stream reasoning;towards better understanding of the performance and design of datalog systems;and intelligent agents and complex event processing to enhance patient monitoring.
We present BSP-Why, a tool for verifying BSP programs. It is intended to be used as an intermediate core-language for verification tools (mainly condition generators) of BSP extensions of realistic programming languag...
详细信息
ISBN:
(纸本)9781450302548
We present BSP-Why, a tool for verifying BSP programs. It is intended to be used as an intermediate core-language for verification tools (mainly condition generators) of BSP extensions of realistic programming languages such as C, JAVA, etc. BSP-Why is based on a sequential simulation of the BSP programs which allows to generate pure sequential codes for the back-end condition generator Why and thus benefit of its large range of existing provers - proof assistants or automatic decision procedures. In this manner, BSP-Why is able to generate proof obligations for BSP programs.
Finite maps or finite relations between infinite sets do not even form a category, since the necessary identities are not finite. We show relation-algebraic extensions of semigroupoids where the operations that would ...
详细信息
Finite maps or finite relations between infinite sets do not even form a category, since the necessary identities are not finite. We show relation-algebraic extensions of semigroupoids where the operations that would produce infinite results have been replaced with variants that preserve finiteness, but still satisfy useful algebraic laws. the resulting theories allow calculational reasoning in the relation-algebraic style with only minor sacrifices;our emphasis on generality even provides some concepts in theories where they had not been available before. the semigroupoid theories presented in this paper also can directly guide library interface design and thus be used for principled relation-algebraic programming;an example implementation in Haskell allows manipulating finite binary relations as data in a point-free relation-algebraic programming style that integrates naturally withthe current Haskell collection types. this approach enables seamless integration of relation-algebraic formulations to provide elegant solutions of problems that, with different data organisation, are awkward to tackle. (C) 2007 Elsevier Inc. All rights reserved.
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 focus of this paper lies on the proof-theory for extensions of logicprogramming in which it is possible to draw negative conclusions both in a direct (i.e., based on a proof) and in an indirect (i.e., based on th...
详细信息
A method by the authors for automated model building is extended and specialized in a natural way in order to increase the possibilities of logicprogramming. A rather complete, though reasonably short, description of...
详细信息
In this paper the mechanism of Default Rules for narrowing-based languages proposed in [24] is adapted to lazy narrowing. Every partial definition of a function can be completed with a default rule. In a concrete func...
详细信息
Are higher-order extensions to logicprogramming needed? We suggest a negative answer by showing that higher-order features are already available in pure logicprogramming. It is demonstrated that higher-order lambda ...
详细信息
We present a logicprogramming language where both problem domain and computational knowledge are expressed in logic. A logic program in this language consists of an object-program and a number of meta-programs. the o...
详细信息
暂无评论