Sciweavers

1247 search results - page 134 / 250
» Reasoning about Function Objects
Sort
View
TPHOL
2008
IEEE
15 years 4 months ago
A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
Correctness of many hybrid and distributed systems require stability and convergence guarantees. Unlike the standard induction principle for verifying invariance, a theory for veri...
Sayan Mitra, K. Mani Chandy
IAT
2007
IEEE
15 years 4 months ago
Planning and Choosing: Augmenting HTN-Based Agents with Mental Attitudes
This paper describes a new agent framework that fuses an HTN planner, through its underlying conceptual model, with the mental attitudes of the BDI agent architecture, thus exploi...
Gerhard Wickler, Stephen Potter, Austin Tate, Mich...
INFOCOM
2007
IEEE
15 years 4 months ago
A Framework for Tiered Service in MPLS Networks
— Many network operators offer some type of tiered service, in which users may select only from a small set of service levels (tiers). Such a service has the potential to simplif...
George N. Rouskas, Nikhil Baradwaj
ICLP
2007
Springer
15 years 4 months ago
Minimal Logic Programs
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
Pedro Cabalar, David Pearce, Agustín Valver...
TCC
2007
Springer
104views Cryptology» more  TCC 2007»
15 years 4 months ago
Obfuscation for Cryptographic Purposes
Abstract. An obfuscation O of a function F should satisfy two requirements: firstly, using O it should be possible to evaluate F; secondly, O should not reveal anything about F th...
Dennis Hofheinz, John Malone-Lee, Martijn Stam