Sciweavers

424 search results - page 76 / 85
» A Lambda Calculus with Forms
Sort
View
FUZZIEEE
2007
IEEE
14 years 3 months ago
Toward Multiple-agent Extensions of Possibilistic Logic
— Possibilistic logic is essentially a formalism for handling qualitative uncertainty with an inference machinery that remains close to the one of classical logic. It is capable ...
Didier Dubois, Henri Prade
ATVA
2007
Springer
108views Hardware» more  ATVA 2007»
14 years 3 months ago
A New Approach to Bounded Model Checking for Branching Time Logics
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
Rotem Oshman, Orna Grumberg
GPCE
2007
Springer
14 years 3 months ago
Oz/K: a kernel language for component-based open programming
Programming in an open environment remains challenging because it requires combining modularity, security, concurrency, distribution, and dynamicity. In this paper, we propose an ...
Michael Lienhardt, Alan Schmitt, Jean-Bernard Stef...
LPAR
2007
Springer
14 years 3 months ago
Preferential Description Logics
In this paper we propose a nonmonotonic extension ALC + Tmin of the Description Logic ALC for reasoning about prototypical properties and inheritance with exception. The logic ALC ...
Laura Giordano, Valentina Gliozzi, Nicola Olivetti...
ACSC
2006
IEEE
14 years 2 months ago
Programming with heterogeneous structures: manipulating XML data using bondi
Manipulating semistructured data, such as XML, does not t well within conventional programming languages. A typical manipulation requires nding all occurrences of a structure matc...
F. Y. Huang, C. B. Jay, David B. Skillicorn