1020 search results - page 151 / 204 » Tight Semantics for Logic Programs |
POPL
2010
ACM
15 years 9 months ago
2010
ACM
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...
100
click to vote
AUSAI
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
109
click to vote
EPIA
2003
Springer
15 years 5 months ago
2003
Springer
The Semantic Web is a “living organism”, which combines autonomously evolving data sources/knowledge repositories. This dynamic character of the Semantic Web requires (declarat...
118
click to vote
ESWS
2006
Springer
15 years 3 months ago
2006
Springer
Knowledge representation formalisms used on the Semantic Web adhere to a strict open world assumption. Therefore, nonmonotonic reasoning techniques are often viewed with scepticism...
131
click to vote
TLDI
2010
ACM
15 years 18 hour ago
2010
ACM
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...