the generation and testing of hypotheses is widely considered to be the primary method by which Science progresses. So much so, that it is still common to find a scientific proposal or an intellectual argument damned ...
详细信息
ISBN:
(纸本)3540229418
the generation and testing of hypotheses is widely considered to be the primary method by which Science progresses. So much so, that it is still common to find a scientific proposal or an intellectual argument damned on the grounds that it has no hypothesis being tested, it is merely a fishing expedition, and so on. Extreme versions run if there is no hypothesis, it is not Science, the clear implication being that hypothesis-driven programmes (as opposed to data-driven studies) are the only contributor to the scientific endeavour. this misrepresents how knowledge and understanding are actually generated from the study of natural phenomena and laboratory experiments. Hypothesis-driven and inductive modes of reasoning are not competitive, but complementary, and both are required in post-genomic biology.
We present the first terminating tableau calculus for basic hybrid logic withthe difference modality and converse modalities. the language under consideration is basic multi-modal logic extended with nominals, the sa...
详细信息
ISBN:
(纸本)9783540710691
We present the first terminating tableau calculus for basic hybrid logic withthe difference modality and converse modalities. the language under consideration is basic multi-modal logic extended with nominals, the satisfaction operator, converse, global and difference modalities. All of the constructs are handled natively. To obtain termination, we extend chain-based blocking for logics with converse by a complete treatment of difference. Completeness of our calculus is shown via a model existence theorem that refines previous constructions by distinguishing between modal and equational state equivalence.
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. basic superposition, a calculus highly ...
详细信息
ISBN:
(纸本)3540252363
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. basic superposition, a calculus highly optimized for theorem proving with equality. However, even such an advanced calculus does not restrict inferences enough to obtain decision procedures for complex logics, such as SHIQ. In this paper, we present a new decomposition inference rule, which can be combined with any resolution-based calculus compatible withthe standard notion of redundancy. We combine decomposition with basic superposition to obtain three new decision procedures: (i) for the description logic SHIQ, (ii) for the description logic ALCHIQb, and (iii) for answering conjunctive queries over SHIQ knowledge bases. the first two procedures are worst-case optimal and, based on the vast experience in building efficient theorem provers, we expect them to be suitable for practical usage.
We survey results about static analysis of pattern-based queries over XML documents. these queries are analogs of conjunctive queries, their unions and Boolean combinations, in which tree patterns play the role of ato...
详细信息
We describe symbol elimination and consequence finding in the first-order theorem prover Vampire for automatic generation of quantified invariants, possibly with quantifier alternations, of loops with arrays. Unlike t...
详细信息
ISBN:
(纸本)9783662488997;9783662488980
We describe symbol elimination and consequence finding in the first-order theorem prover Vampire for automatic generation of quantified invariants, possibly with quantifier alternations, of loops with arrays. Unlike the previous implementation of symbol elimination in Vampire, our work is not limited to a specific programming language but provides a generic framework by relying on a simple guarded command representation of the input loop. We also improve the loop analysis part in Vampire by generating loop properties more easily handled by the saturation engine of Vampire. Our experiments show that, with our changes, the number of generated invariants is decreased, in some cases, by a factor of 20. We also provide a framework to use our approach to invariant generation in conjunction with pre- and post-conditions of program loops. We use the program specification to find relevant invariants as well as to verify the partial correctness of the loop. As a case study, we demonstrate how symbol elimination in Vampire can be used as an interface for realistic imperative languages, by integrating our tool in the KeY verification system, thus allowing reasoning about loops in Java programs in a fully automated way, without any user guidance.
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...
详细信息
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves as the basis of logicprogramming and...
详细信息
ISBN:
(纸本)3540255966
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves as the basis of logicprogramming and term rewriting techniques that provide similar advantages to, but remain simpler than, higher-order logicprogramming or term rewriting systems. Previous work on nominal rewriting and logicprogramming has relied on nominal unification, that is, unification up to equality in nominal logic. However, because of nominal logic's equivariance property, these applications require a stronger form of unification, which we call equivariant unification. Unfortunately, equivariant unification and matching are NP-hard decision problems. this paper presents an algorithm for equivariant unification that produces a complete set of finitely many solutions, as well as NP decision procedure and a version that enumerates solutions one at a time. In addition, we present a polynomial time algorithm for swapping-free equivariant matching, that is, for matching problems in which the swapping operation does not appear.
In most works on negotiation dialogues, agents are supposed to be ideally honest. However, there are many situations where such a behaviour cannot always be expected from the agents (e.g. advertising, political negoti...
详细信息
When constructing complex program analyses, it is often useful to reason about not just individual values, but collections of values. Symbolic set abstractions provide building blocks that can be used to partition ele...
详细信息
ISBN:
(纸本)9783662488997;9783662488980
When constructing complex program analyses, it is often useful to reason about not just individual values, but collections of values. Symbolic set abstractions provide building blocks that can be used to partition elements, relate partitions to other partitions, and determine the provenance of multiple values, all without knowing any concrete values. To address the simultaneous challenges of scalability and precision, we formalize and implement an interface for symbolic set abstractions and construct multiple abstract domains relying on both specialized data structures and off-the-shelf theorem provers. We develop techniques for lifting existing domains to improve performance and precision. We evaluate these domains on real-world data structure analysis problems.
In the travel industry it is common for tour operators to pre-book from service suppliers blocks of package tours, which are called allotments in jargon. the selection of package tours is done according to several pre...
详细信息
ISBN:
(数字)9783319220024
ISBN:
(纸本)9783319220024;9783319220017
In the travel industry it is common for tour operators to pre-book from service suppliers blocks of package tours, which are called allotments in jargon. the selection of package tours is done according to several preference criteria aimed at maximizing the expected earnings given a budget. In this paper we formalize an allotment problem that abstracts the requirements of a real travel agent, and we solve it using Answer Set programming. the obtained specification is executable, and it implements an advanced feature of the iTravel+ system.
暂无评论