131,525 research outputs found
{SCL(EQ)}: {SCL} for First-Order Logic with Equality
International audienceAbstract We propose a new calculus SCL(EQ) for first-order logic with equality that only learns non-redundant clauses. Following the idea of CDCL (Conflict Driven Clause Learning) and SCL (Clause Learning from Simple Models) a ground literal model assumption is used to guide inferences that are then guaranteed to be non-redundant. Redundancy is defined with respect to a dynamically changing ordering derived from the ground literal model assumption. We prove SCL(EQ) sound and complete and provide examples where our calculus improves on superposition
SCL(EQ): SCL for First-Order Logic with Equality
We propose a new calculus SCL(EQ) for first-order logic with equality thatonly learns non-redundant clauses. Following the idea of CDCL (Conflict DrivenClause Learning) and SCL (Clause Learning from Simple Models) a ground literalmodel assumption is used to guide inferences that are then guaranteed to benon-redundant. Redundancy is defined with respect to a dynamically changingordering derived from the ground literal model assumption. We prove SCL(EQ)sound and complete and provide examples where our calculus improves onsuperposition.<br
Relational Parametricity and Separation Logic
Separation logic is a recent extension of Hoare logic for reasoning about
programs with references to shared mutable data structures. In this paper, we
provide a new interpretation of the logic for a programming language with
higher types. Our interpretation is based on Reynolds's relational
parametricity, and it provides a formal connection between separation logic and
data abstraction
Random Logic Programs: Linear Model
This paper proposes a model, the linear model, for randomly generating logic
programs with low density of rules and investigates statistical properties of
such random logic programs. It is mathematically shown that the average number
of answer sets for a random program converges to a constant when the number of
atoms approaches infinity. Several experimental results are also reported,
which justify the suitability of the linear model. It is also experimentally
shown that, under this model, the size distribution of answer sets for random
programs tends to a normal distribution when the number of atoms is
sufficiently large.Comment: 33 pages. To appear in: Theory and Practice of Logic Programmin
Two Decades of Maude
This paper is a tribute to José Meseguer, from the rest of us in the Maude team, reviewing the past, the present, and the future of the language and system with which we have been working for around two decades under his leadership. After reviewing the origins and the language's main features, we present the latest additions to the language and some features currently under development. This paper is not an introduction to Maude, and some familiarity with it and with rewriting logic are indeed assumed.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech
Proving theorems by program transformation
In this paper we present an overview of the unfold/fold proof method, a method for proving theorems about programs, based on program transformation. As a metalanguage for specifying programs and program properties we adopt constraint logic programming (CLP), and we present a set of transformation rules (including the familiar unfolding and folding rules) which preserve the semantics of CLP programs. Then, we show how program transformation strategies can be used, similarly to theorem proving tactics, for guiding the application of the transformation rules and inferring the properties to be proved. We work out three examples: (i) the proof of predicate equivalences, applied to the verification of equality between CCS processes, (ii) the proof of first order formulas via an extension of the quantifier elimination method, and (iii) the proof of temporal properties of infinite state concurrent systems, by using a transformation strategy that performs program specialization
- …