Sciweavers

109 search results - page 18 / 22
» Characterization of Logics over Ranked Tree Languages
Sort
View
ICFP
2006
ACM
15 years 9 months ago
A pattern for almost compositional functions
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...
Aarne Ranta, Björn Bringert
AAAI
2008
15 years 4 days ago
Determining Possible and Necessary Winners under Common Voting Rules Given Partial Orders
Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alterna...
Lirong Xia, Vincent Conitzer
IJCAI
2003
14 years 11 months ago
Querying Distributed Data through Distributed Ontologies: A Simple but Scalable Approach
In this paper, we define a simple but scalable framework for peer-to-peer data sharing systems, in which the problem of answering queries over a network of semantically related p...
François Goasdoué, Marie-Christine R...
IPPS
2006
IEEE
15 years 3 months ago
An overview of the Jahob analysis system: project goals and current status
We present an overview of the Jahob system for modular analysis of data structure properties. Jahob uses a subset of Java as the implementation language and annotations with formu...
Viktor Kuncak, Martin C. Rinard
SIGSOFT
2003
ACM
15 years 3 months ago
Fluent model checking for event-based systems
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
Dimitra Giannakopoulou, Jeff Magee