Sciweavers

275 search results - page 23 / 55
» Non-Termination Inference of Logic Programs
Sort
View
DLOG
2003
14 years 11 months ago
From Description Logic Provers to Knowledge Representation Systems
A description-logic based knowledge representation system is more than an inference engine for a particular description logic. A knowledge representation system must provide a num...
Deborah L. McGuinness, Peter F. Patel-Schneider
AROBOTS
1998
113views more  AROBOTS 1998»
14 years 9 months ago
Grounding Mundane Inference in Perception
We describe a uniform technique for representing both sensory data and the attentional state of an agent using a subset of modal logic with indexicals. The resulting representation...
Ian Horswill
WCRE
2007
IEEE
15 years 4 months ago
Parametric Process Model Inference
Legacy applications can be difficult and time-consuming to understand and update due to the lack of modern abstraction mechanisms in legacy languages, as well as the gradual dete...
Saurabh Sinha, G. Ramalingam, Raghavan Komondoor
POPL
2010
ACM
15 years 7 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
ICLP
2003
Springer
15 years 3 months ago
Termination Analysis with Types Is More Accurate
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
Vitaly Lagoon, Frédéric Mesnard, Pet...