Sometimes it is pragmatically useful to prove a theorem by contradiction rather than finding a direct proof. Some reductio ad absurdum arguments have made mathematical history and ...
Abstract. Probabilistic model checking is a formal verification technique that has been successfully applied to the analysis of systems from a broad range of domains, including sec...
John Heath, Marta Z. Kwiatkowska, Gethin Norman, D...
AgentSpeak is a well-known language for programming intelligent agents which captures the key features of reactive planning systems in a simple framework with an elegant formal sem...
How do Members of Congress manage the opportunities that the Internet offers? Here we present the initial results from interviews with 100 Congressional offices about their decisi...
David Lazer, Ines Mergel, Curt Ziniel, Kevin Ester...
In our research we study rational agents which learn how to choose the best conditional, partial plan in any situation. The agent uses an incomplete symbolic inference engine, emp...