this paper describes a proof search system for a modal substructural (concatenation) logic based on Gabbay’s Labelled Deductive System (LDS) as a case study. the logic combines resource (linear or Lambek Calculus) wi...
详细信息
We propose an extension to Definite Horn Clauses by placing partial orders on the bodies of clauses. Such clauses are called relaxable clauses. these partial orders are interpreted as a specification of relaxation cri...
详细信息
the functional translation from modal logic into first-order predicate logic is revised. Quantifier elimination of second-order predicates is used to translate almost arbitrary modal systems, i.e. not only modal formu...
详细信息
We give a reduction, in polynomlaly bounded time, of the satisfiability problem in the set language MPLS, to an equivalent linear integer programming problem. We show that this provide s an algorithm to decide the Set...
详细信息
In this paper, we present a resolution calculus extended by the notion of symmetries. A new deduction rule named symmetry extension is introduced. Combining resolution deduction and symmetry extension yields a new ext...
详细信息
this paper presents a general approach to the Abstract Interpretation of Prolog programs with cut. In most of previous approaches the cut primitive is merely ignored. Our method consists in trasforming an interpreter ...
详细信息
In this paper we present a method to detect non-terminating ox failing queries based on analyzing the dynamic growth of terms. It overcomes restrictions known from approaches to preclude infinite loops in the field of...
详细信息
Several methods to compute the prime implicants and the prime implicates of a negation normal form (NNF) formula are developed and implemented. An algorithm PI is introduced that is an extension to negation normal for...
详细信息
We propose in this paper a type inference system for extracting inheritance hierarchies from Prolog programs. the inferred types define a superset of the denotation of the program, and a subset of the least fixed poin...
详细信息
Often, calculi for manipulating and reasoning about programs can be recast as calculi for synthesizing programs. the difference involves often only a slight shift of perspective: admitting metavariables into proofs. W...
详细信息
ISBN:
(纸本)9780818643606
Often, calculi for manipulating and reasoning about programs can be recast as calculi for synthesizing programs. the difference involves often only a slight shift of perspective: admitting metavariables into proofs. We propose that such calculi should be implemented in logical frameworks that support this kind of proof construction and that such an implementation can unify program verification and synthesis. the proposal is illustrated with a worked example developed in L.C. Paulson's (1990) Isabelle system. We also give examples of existent calculi that are closely related to the methodology we are proposing and others that can be profitably recast using the approach.< >
暂无评论