Sciweavers

2137 search results - page 235 / 428
» Proving Abstract Non-interference
Sort
View
131
Voted
CADE
2010
Springer
15 years 4 months ago
Sledgehammer: Judgement Day
Abstract. Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higher-order logic by calling the automated provers for first-order logic E, SPASS a...
Sascha Böhme, Tobias Nipkow
139
Voted
CADE
2010
Springer
15 years 4 months ago
Analytic Tableaux for Higher-Order Logic with Choice
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
Julian Backes, Chad E. Brown
113
Voted
CCIA
2009
Springer
15 years 4 months ago
Secure and Optimal Base Contraction in Graded Lukasiewicz Logics
Abstract. The operation of base contraction was successfully characterized for a very general class of logics using the notion of remainder sets. Although, in the general case, thi...
Pere Pardo, Pilar Dellunde, Lluis Godo
112
Voted
ECAI
2010
Springer
15 years 4 months ago
A unified interaction-aware goal framework
Abstract. Goals are central to the design and implementation of intelligent software agents. Much of the literature on goals and reasoning about goals only deals with a limited set...
Michael Winikoff, Mehdi Dastani, M. Birna van Riem...
128
Voted
ESA
2010
Springer
203views Algorithms» more  ESA 2010»
15 years 4 months ago
A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing
Abstract. We study the problem of designing group-strategyproof costsharing mechanisms. The players report their bids for getting serviced and the mechanism decides a set of player...
Emmanouil Pountourakis, Angelina Vidali