Sciweavers

756 search results - page 96 / 152
» Using Logic Programs to Reason about Infinite Sets
Sort
View
LOPSTR
2007
Springer
15 years 3 months ago
Denotation by Transformation
Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...
Bernd Braßel, Jan Christiansen
JAIR
2011
72views more  JAIR 2011»
14 years 4 months ago
A Logical Study of Partial Entailment
We introduce a novel logical notion–partial entailment–to propositional logic. In contrast with classical entailment, that a formula P partially entails another formula Q with...
Y. Zhou, Y. Zhang
ILP
2004
Springer
15 years 3 months ago
Modelling Inhibition in Metabolic Pathways Through Abduction and Induction
Abstract. In this paper, we study how a logical form of scientific modelling that integrates together abduction and induction can be used to understand the functional class of unk...
Alireza Tamaddoni-Nezhad, Antonis C. Kakas, Stephe...
ICFP
2009
ACM
15 years 10 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
POPL
2005
ACM
15 years 10 months ago
Region-based shape analysis with tracked locations
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap locations of global reasoning about entire heap abstractions. We present an int...
Brian Hackett, Radu Rugina