1115 search results - page 10 / 223 » An Abstract Look at Realizability |
158
click to vote
FORMATS
2009
Springer
16 years 15 days ago
2009
Springer
Abstract. We study the realizability problem for specifications of reactive systems expressed in real-time linear temporal logics. The logics we consider are subsets of MITL (Metr...
124
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We prove that interactive learning based classical realizability (introduced by Aschieri and Berardi for first order arithmetic [1]) is sound with respect to Coquand game...
123
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— This paper deals with realization theory of socalled Nash systems, i.e. nonlinear systems the right-hand side of which is defined by Nash functions. A Nash function is...
194
click to vote
ECSQARU
2009
Springer
16 years 15 days ago
2009
Springer
Abstract. We consider a realization of Reiter-style default logic on top of description logic knowledge bases (DL-KBs). To this end, we present elegant transformations from default...
143
click to vote
FASE
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. The Object Constraint Language OCL offers a formal notation for constraining the modelling elements occurring in UML diagrams. In this paper we apply OCL for developing ...