Sciweavers

1117 search results - page 67 / 224
» Partial Models of Extended Generalized Logic Programs
Sort
View
ICFP
2005
ACM
14 years 8 months ago
Translating specifications from nominal logic to CIC with the theory of contexts
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
Marino Miculan, Ivan Scagnetto, Furio Honsell
ER
1995
Springer
152views Database» more  ER 1995»
14 years 8 days ago
A Logic Framework for a Semantics of Object-Oriented Data Modeling
We describe a (meta) formalism for defining a variety of (object oriented) data models in a unified framework based on a variation of first-order logic. As specific example we use...
Olga De Troyer, Robert Meersman
VLC
2011
83views more  VLC 2011»
13 years 3 months ago
A decision procedure for a decidable fragment of generalized constraint diagrams
Constraint diagrams were introduced by Kent, in 1997, as an alternative to the OCL for placing formal constraints on software models. Since their introduction, constraint diagrams...
Jim Burton, Gem Stapleton, Ali Hamie
JLP
2007
114views more  JLP 2007»
13 years 8 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
AAAI
2007
13 years 11 months ago
On the Partial Observability of Temporal Uncertainty
We explore a means to both model and reason about partial observability within the scope of constraintbased temporal reasoning. Prior studies of uncertainty in Temporal CSPs have ...
Michael D. Moffitt