Sciweavers

3658 search results - page 139 / 732
» The logic of proofs, semantically
Sort
View
CORR
2002
Springer
98views Education» more  CORR 2002»
13 years 10 months ago
A Framework for Compiling Preferences in Logic Programs
We introduce a methodology and framework for expressing general preference information in logic programming under the answer set semantics. An ordered logic program is an extended...
James P. Delgrande, Torsten Schaub, Hans Tompits
MPC
1995
Springer
125views Mathematics» more  MPC 1995»
14 years 2 months ago
Synthesizing Proofs from Programs in the Calculus of Inductive Constructions
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...
Catherine Parent
JAR
2008
124views more  JAR 2008»
13 years 11 months ago
Formal Verification of a C-like Memory Model and Its Uses for Verifying Program Transformations
This article presents the formal verification, using the Coq proof assistant, of a memory model for low-level imperative languages such as C and compiler intermediate languages. Be...
Xavier Leroy, Sandrine Blazy
ICLP
2010
Springer
14 years 2 months ago
A Logical Paradigm for Systems Biology (Invited Talk)
[6]. An SBML model can be interpreted in Biocham at three abstraction levels: • the Boolean semantics (asynchronuous Boolean state transitions on the presence/absence of molecule...
François Fages
ENTCS
2007
86views more  ENTCS 2007»
13 years 10 months ago
Tinycals: Step by Step Tacticals
Most of the state-of-the-art proof assistants are based on procedural proof languages, scripts, and rely on LCF tacticals as the primary tool for tactics composition. In this pape...
Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacc...