Sciweavers

330 search results - page 54 / 66
» Open Problems in Logic and Games
Sort
View
EUSFLAT
2009
124views Fuzzy Logic» more  EUSFLAT 2009»
13 years 5 months ago
A toward Framework for Generic Uncertainty Management
The need for an automatic inference process able to deal with information coming from unreliable sources is becoming a relevant issue both on corporate networks and on the open Web...
Ernesto Damiani, Paolo Ceravolo, Marcello Leida
DSS
2002
231views more  DSS 2002»
13 years 7 months ago
Computational aspects of the FLBC framework
Recent research has sought to develop formal languages for business communication as more expressive, flexible and powerful alternatives to current electronic data interchange (ED...
Aspassia Daskalopulu, Marek J. Sergot
FOCS
2008
IEEE
14 years 2 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
LICS
2009
IEEE
14 years 2 months ago
Ludics with Repetitions (Exponentials, Interactive Types and Completeness)
Abstract. Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies ...
Michele Basaldella, Claudia Faggian
CHARME
2005
Springer
94views Hardware» more  CHARME 2005»
14 years 1 months ago
Verifying Quantitative Properties Using Bound Functions
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
Arindam Chakrabarti, Krishnendu Chatterjee, Thomas...