Sciweavers

3793 search results - page 390 / 759
» Expressive Description Logics
Sort
View
LOPSTR
2005
Springer
16 years 8 days ago
Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
Partial evaluation of logic programs which contain impure predicates poses non-trivial challenges. Impure predicates include those which produce side-effects, raise errors (or exc...
Elvira Albert, Germán Puebla, John P. Galla...
188
Voted
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 11 months ago
Exploiting Positive Equality in a Logic of Equality with Uninterpreted Functions
Abstract. In using the logic of equality with unininterpreted functions to verify hardware systems, specific characteristics of the formula describing the correctness condition ca...
Randal E. Bryant, Steven M. German, Miroslav N. Ve...
SIGECOM
2003
ACM
115views ECommerce» more  SIGECOM 2003»
16 years 1 days ago
Betting boolean-style: a framework for trading in securities based on logical formulas
We develop a framework for trading in compound securities: financial instruments that pay off contingent on the outcomes of arbitrary statements in propositional logic. Buying o...
Lance Fortnow, Joe Kilian, David M. Pennock, Micha...
ICFP
2010
ACM
15 years 7 months ago
Logical types for untyped languages
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...
Sam Tobin-Hochstadt, Matthias Felleisen
CORR
2004
Springer
151views Education» more  CORR 2004»
15 years 6 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...