Sciweavers

97 search results - page 17 / 20
» A Systematic Proof Theory for Several Modal Logics
Sort
View
ATAL
2010
Springer
14 years 9 months ago
Using answer set programming to model multi-agent scenarios involving agents' knowledge about other's knowledge
One of the most challenging aspects of reasoning, planning, and acting in a multi-agent domain is reasoning about what the agents know about the knowledge of their fellows, and to...
Chitta Baral, Gregory Gelfond, Tran Cao Son, Enric...
FUIN
2007
110views more  FUIN 2007»
14 years 9 months ago
Controllable Delay-Insensitive Processes
Abstract. Josephs and Udding’s DI-Algebra offers a convenient way of specifying and verifying designs that must rely upon delay-insensitive signalling between modules (asynchrono...
Mark B. Josephs, Hemangee K. Kapoor
POPL
2010
ACM
15 years 7 months ago
Pure Subtype Systems
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
DeLesley S. Hutchins
72
Voted
FAC
2008
97views more  FAC 2008»
14 years 9 months ago
A functional formalization of on chip communications
This paper presents a formal model and a systematic approach to the validation of communication tures at a high level of abstraction. This model is described mathematically by a fu...
Julien Schmaltz, Dominique Borrione
93
Voted
IPL
2007
105views more  IPL 2007»
14 years 9 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk