624 search results - page 103 / 125 » Reasoning with Expressive Description Logics: Theory and Pra... |
POPL
2004
ACM
14 years 9 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
AMAI
1999
Springer
13 years 8 months ago
1999
Springer
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
LISP
2008
13 years 8 months ago
2008
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
POPL
2010
ACM
14 years 6 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
IJCAI
1997
13 years 10 months ago
1997
Explicit preferences on assumptions as used in prioritized circumscription [McCarthy, 1986; Lifschitz, 1985; Grosof, 1991] and preferred subtheories [Brewka, 1989] provide a clear...