Sciweavers

10568 search results - page 341 / 2114
» Computer Intelligence and Formalization
Sort
View
ACL
1990
15 years 5 months ago
The Computational Complexity of Avoiding Conversational Implicatures
Referring expressions and other object descriptions should be maximal under the Local Brevity, No Unnecessary Components, and Lexical Preference preference rules; otherwise, they ...
Ehud Reiter
CORR
2000
Springer
107views Education» more  CORR 2000»
15 years 3 months ago
Computing Presuppositions by Contextual Reasoning
This paper describes howautomated deduction methods for natural language processing can be applied moreefficiently by encodingcontext in a moreelaborate way. Our workis based on f...
Christof Monz
UPP
2004
Springer
15 years 9 months ago
Bio-inspired Computing Paradigms (Natural Computing)
Abstract. This is just a glimpse to the fruitful and constant preoccupation of computer science to try to get inspired by biology, at various levels. Besides briefly discussing th...
Gheorghe Paun
ATAL
2010
Springer
15 years 5 months ago
CTL.STIT: enhancing ATL to express important multi-agent system verification properties
We present the logic CTL.STIT, which is the join of the logic CTL with a multi-agent strategic stit-logic variant. CTL.STIT subsumes ATL, and adds expressivity to it that we claim...
Jan Broersen
ATAL
2010
Springer
15 years 5 months ago
Alternating-time dynamic logic
We propose Alternating-time Dynamic Logic (ADL) as a multi-agent variant of Dynamic Logic in which atomic programs are replaced by coalitions. In ADL, the Dynamic Logic operators ...
Nicolas Troquard, Dirk Walther