A classical higher-order logic PFsub of partial functions is defined. the logic extends a version of Farmer's logic PF by enriching the type system of the logic with subset types and dependent types. Validity in P...
详细信息
ISBN:
(纸本)3540405593
A classical higher-order logic PFsub of partial functions is defined. the logic extends a version of Farmer's logic PF by enriching the type system of the logic with subset types and dependent types. Validity in PFsub is then reduced to validity in PF by a translation.
Many data integration systems provide transparent access to heterogeneous data sources through a unified view of all data in terms of a global schema, which may be equipped with integrity constraints on the data. Sinc...
详细信息
ISBN:
(纸本)3540206426
Many data integration systems provide transparent access to heterogeneous data sources through a unified view of all data in terms of a global schema, which may be equipped with integrity constraints on the data. Since these constraints might be violated by the data retrieved from the sources, methods for handling such a situation are needed. To this end, recent approaches model query answering in data integration systems in terms of nonmonotonic logic programs. However, while the theoretical aspects have been deeply analyzed, there are no real implementations of this approach yet. A problem is that the reasoning tasks modeling query answering are computationally expensive in general, and that a direct evaluation on deductive database systems is infeasible for large data sets. In this paper, we investigate techniques which make user query answering by logic programs effective. We develop pruning and localization methods for the data which need to be processed in a deductive system, and a technique for the recombination of the results on a relational database engine. Experiments indicate the viability of our methods and encourage further research of this approach.
the author has developed a system that analyzes the long term performance of equity mutual rands. the import of this work does not lie in the accuracy of the results (which the author believes to be very good, based o...
详细信息
We present an approach to probabilistic logicprogramming and probabilistic argumentation that combines elements of the L-stable semantics and the credal semantics. We derive the complexity of inferences, propose an e...
详细信息
It is generally agreed upon that so-called strong persistence (SP) captures best the essence of forgetting in logicprogramming. While classes of operators, such as FR and FSP, that satisfy immediate relaxations of (S...
详细信息
ID-logic uses ideas from the field of logicprogramming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this logic in terms of approximation theory, a...
详细信息
ID-logic uses ideas from the field of logicprogramming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this logic in terms of approximation theory, an algebraic theory which generalizes the semantics of several non-monotonic reasoning formalisms. this allows us to apply certain abstract modularity theorems, developed within the framework of approximation theory, to ID-logic. As such, we are able to offer elegant and simple proofs of generalizations of known theorems, as well as some new results.
the proceedings contain 14 papers. the special focus in this conference is on Practical Aspects of Declarative Languages. the topics include: Eliminating irrelevant non determinism in functional logic programs;canonic...
ISBN:
(纸本)9783319516752
the proceedings contain 14 papers. the special focus in this conference is on Practical Aspects of Declarative Languages. the topics include: Eliminating irrelevant non determinism in functional logic programs;canonicalizing high-level constructs in picat;integrating answer set programming with object-oriented languages;extending answer set programs with interpreted functions as first-class citizens;lowering the learning curve for declarative programming;overlapping patterns for property-based testing;Boltzmann samplers for closed simply-typed lambda terms;selection equilibria of higher-order games;principles and prototype implementation;declarative programming of full-fledged musical applications;a domain-specific language for software-defined radio;a declarative DSL for customizing ASCII art and using iterative deepening for probabilistic logic inference.
the proceedings contain 8 papers. the special focus in this conference is on Rewriting Techniques and Applications. the topics include: New developments in environment machines;strategy-based rewrite semantics for mem...
the proceedings contain 8 papers. the special focus in this conference is on Rewriting Techniques and Applications. the topics include: New developments in environment machines;strategy-based rewrite semantics for membrane systems preserves maximal concurrency of rewrite actions;recognizing strategies;operational termination of conditional rewriting with built-in numbers and semantic data structures;completion as post-process in program inversion of injective functions;a transformational approach to prove outermost termination automatically;computing with diagrams in classical logic and closure of tree automata languages under innermost rewriting.
Withthe proliferation of the Semantic Web, there has been a rapidly rising interest in description logics, which form the logical foundation of the W3C standard ontology language OWL. While the number of OWL knowledg...
详细信息
ISBN:
(纸本)9783642138393
Withthe proliferation of the Semantic Web, there has been a rapidly rising interest in description logics, which form the logical foundation of the W3C standard ontology language OWL. While the number of OWL knowledge bases grows, there is an increasing demand for tools assisting knowledge engineers in building up and maintaining their structure. For this purpose, concept learning algoritlans based on refinement operators have been investigated. In this paper, we provide an ideal refinement;operator for the description logic epsilon L and show that it is computationally feasible on large knowledge bases.
暂无评论