We report on a successful experiment of computer-aided theorem discovery in the area of logicprogramming with answer set semantics. Specifically, withthe help of computers, we discovered exact conditions that captur...
详细信息
We report on a successful experiment of computer-aided theorem discovery in the area of logicprogramming with answer set semantics. Specifically, withthe help of computers, we discovered exact conditions that capture the strong equivalence between a set of a rule and the empty set, a set of a rule and another set of a rule, a set S of two rules and a subset of S with one rule, a set of two rules and a set of another rule, and a set S of three rules and a subset of S with two rules. We prove some general theorems that can help us verify the correctness of these conditions, and discuss the usefulness of our results in program simplification.
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.
.Abstract logicprogramming is about designing logicprogramming languages via the proof theoretic notion of uniform provability. It allows the design of purely logical, very expressive logicprogramming languages, en...
详细信息
ISBN:
(纸本)3540206426
.Abstract logicprogramming is about designing logicprogramming languages via the proof theoretic notion of uniform provability. It allows the design of purely logical, very expressive logicprogramming languages, endowed with a rich meta theory. this tutorial intends to expose the main ideas of this discipline in the most direct and simple way.
this paper deals with automation of a creep-testing machine mainly dedicated to research activities. the requirements linked to the machine were established by the material science researchers. these requirements were...
详细信息
ISBN:
(纸本)9781538654132
this paper deals with automation of a creep-testing machine mainly dedicated to research activities. the requirements linked to the machine were established by the material science researchers. these requirements were then addressed to mechatronic researchers and teachers. In order to enhance the link between research activities and training in the engineering school linked to the research laboratory, students projects of Master degree driven by researchers were proposed. these projects were totally multi-disciplinary, mobilizing knowledge acquired by students during their cursus in the school. Several items were developed by students: automation, mechanics, power electronics and real-time programming.
Hexoses are simple sugars that play a key role in many cellular pathways, and in the regulation of development and disease mechanisms. Current protein-sugar computational models are based, at least partially, on prior...
详细信息
ISBN:
(纸本)9783642138393
Hexoses are simple sugars that play a key role in many cellular pathways, and in the regulation of development and disease mechanisms. Current protein-sugar computational models are based, at least partially, on prior biochemical findings and knowledge. they incorporate different parts of these findings in predictive black-box models. We investigate the empirical support for biochemical findings by comparing inductivelogicprogramming (ILP) induced rules to actual biochemical results. We mine the Protein Data Bank for a representative data set of hexose binding sites, non-hexose binding sites and surface grooves. We build an ILP model of hexose-binding sites and evaluate our results against several baseline machine learning classifiers. Our method achieves an accuracy similar to that of other black-box classifiers while providing insight into the discriminating process. In addition, it confirms wet-lab findings and reveals a previously unreported TRP-GLU amino acids dependency.
We propose a path-based framework for deriving and simplifying source-tracking information for first-order term unification in the empty theory. Such a framework is useful for diagnosing unification-based systems, inc...
详细信息
We propose a path-based framework for deriving and simplifying source-tracking information for first-order term unification in the empty theory. Such a framework is useful for diagnosing unification-based systems, including debugging of type errors in programs and the generation of success and failure proofs in logicprogramming. the objects of source-tracking are deductions in the logic of term unification. the semantics of deductions are paths over a unification graph whose labels form the suffix language of a semi-Dyck set. Based on this idea of unification paths, two algorithms for generating proofs are presented: the first uses context-free labeled shortest-path algorithms to generate optimal (shortest) proofs in time O(n(3)) for a fixed signature, where n is the number of vertices of the unification graph. the second algorithm integrates easily with standard unification algorithms, entailing an overhead of only a constant factor, but generates non-optimal proofs. these non-optimal proofs may be further simplified by group rewrite rules. (c) 2005 Elsevier Inc. All rights reserved.
the work described here is motivated by our interest in the methodology of answer set programming (ASP). the idea of ASP is to solve a problem by writing a logic program the answer sets of which correspond to solutions.
ISBN:
(纸本)3540206426
the work described here is motivated by our interest in the methodology of answer set programming (ASP). the idea of ASP is to solve a problem by writing a logic program the answer sets of which correspond to solutions.
this paper studies equivalence issues in inductivelogicprogramming. A background theory B-1 is inductively equivalent to another background theory B-2 if B-1 and B-2 induce the same hypotheses for any given set of e...
详细信息
ISBN:
(纸本)3540281770
this paper studies equivalence issues in inductivelogicprogramming. A background theory B-1 is inductively equivalent to another background theory B-2 if B-1 and B-2 induce the same hypotheses for any given set of examples. inductive equivalence is useful to compare inductive capabilities among agents having different background theories. Moreover, it provides conditions for optimizing background theories through appropriate program transformations. In this paper, we consider three different classes of background theories: clausal theories, Horn logic programs, and nonmonotonic extended logic programs. We show that logical equivalence is the necessary and sufficient condition for inductive equivalence in clausal theories and Horn logic programs. In nonmonotonic extended logic programs, on the other hand, strong equivalence is necessary and sufficient for inductive equivalence in general. Interestingly, however, we observe that several existing induction algorithms require weaker conditions of equivalence under restricted problem settings. We also discuss connection to equivalence in abductive logic and conclude that the notion of strong equivalence is useful to characterize equivalence of non-deductive reasoning.
Building on the work of Burstall, this paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are ma...
详细信息
Building on the work of Burstall, this paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are mapped to higher-level data types for verification. the programming language is embedded in higher-order logic. Its Hoare logic is derived. the whole development is purely definitional and thus sound. Apart from some smaller examples, the viability of this approach is demonstrated with a non-trivial case study. We show the correctness of the Schorr-Waite graph marking algorithm and present part of its readable proof in Isabelle/HOL. (c) 2005 Elsevier Inc. All rights reserved.
Nowadays, formal methods are used in various areas for the verification of programs or for code generation from models in order to increase the quality of software and to reduce costs. However, there are still fields ...
详细信息
ISBN:
(纸本)9781728143958
Nowadays, formal methods are used in various areas for the verification of programs or for code generation from models in order to increase the quality of software and to reduce costs. However, there are still fields in which formal methods haven't been widely adopted, despite the large set of possible benefits offered. this is the case for the area of programmable logic controllers (PLC). this article aims to evaluate the potential of formal methods in the context of PLC development. For this purpose, the general concepts of formal methods are first introduced and then transferred to the PLC area, resulting in an engineering-oriented description of the technology that is based on common concepts from PLC development. Based on this description, PLC professionals with varying degrees of experience were interviewed for their perspective on the topic and to identify possible use cases within the PLC domain. the survey results indicate the technology's high potential in the PLC area, either as a tool to directly support the developer or as a key element within a model-based systems engineering toolchain. the evaluation of the survey results is performed withthe aid of a demo application that communicates withthe Totally Integrated Automation Portal from Siemens and generates programs via Fastsynth, a model-based open source code generator. Benchmarks based on an industry-related PLC project show satisfactory synthesis times and a successful integration into the workflow of a PLC developer.
暂无评论