Sciweavers

550 search results - page 87 / 110
» Context Semantics, Linear Logic and Computational Complexity
Sort
View
157
Voted
SIGSOFT
1998
ACM
15 years 10 months ago
Reasoning about Implicit Invocation
Implicit invocation SN92, GN91] has become an important architectural style for large-scale system design and evolution. This paper addresses the lack of speci cation and veri cat...
David Garlan, Somesh Jha, David Notkin
ECAI
2006
Springer
15 years 10 months ago
Least Squares SVM for Least Squares TD Learning
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
Tobias Jung, Daniel Polani
AI
2010
Springer
15 years 6 months ago
Logic-based ontology comparison and module extraction, with an application to DL-Lite
We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of `lightweight' description...
Roman Kontchakov, Frank Wolter, Michael Zakharyasc...
MST
2010
140views more  MST 2010»
15 years 4 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
JAIR
2010
111views more  JAIR 2010»
15 years 4 months ago
Grounding FO and FO(ID) with Bounds
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositional theory. It is used as preprocessing phase in many logic-based reasoning s...
Johan Wittocx, Maarten Mariën, Marc Denecker