Deduction with symbolic constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1990

Deduction with symbolic constraints

Hélène Kirchner
Michaël Rusinowitch

Abstract

A framework for first-order constrained deduction is proposed in this paper. The syntax and semantics of symbolic constraints and constrained formulae are defined. Constrained deduction rules are given for equational logic and for first-order logic with equality. They are applied to clausal theorem proving, unfailing completion and completion modulo a set of axioms.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1358.pdf (1.64 Mo) Télécharger le fichier

Dates and versions

inria-00077103 , version 1 (29-05-2006)

Identifiers

  • HAL Id : inria-00077103 , version 1

Cite

Claude Kirchner, Hélène Kirchner, Michaël Rusinowitch. Deduction with symbolic constraints. [Research Report] RR-1358, INRIA. 1990, pp.46. ⟨inria-00077103⟩
295 View
170 Download

Share

Gmail Facebook Twitter LinkedIn More