Sciweavers

ICALP
2007
Springer
15 years 8 months ago
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
Spyros C. Kontogiannis, Paul G. Spirakis
ICALP
2007
Springer
15 years 8 months ago
A Generalization of Cobham's Theorem to Automata over Real Numbers
Abstract. This paper studies the expressive power of finite-state automata recognizing sets of real numbers encoded positionally. It is known that the sets that are definable in th...
Bernard Boigelot, Julien Brusten
ICAIL
2007
ACM
15 years 8 months ago
The LKIF Core Ontology of Basic Legal Concepts
In this paper we describe a legal core ontology that is part of a generic architecture for legal knowledge systems, which will enable the interchange of knowledge between existing ...
Rinke Hoekstra, Joost Breuker, Marcello Di Bello, ...
ICAIL
2007
ACM
15 years 8 months ago
The Ontology of Legal Possibilities and Legal Potentialities
Ontologies in a legal expert system must be processed to suit all possible user cases within the field of law of the system. From the logical premises of a deductive system of expr...
Pamela N. Gray