Sciweavers

764 search results - page 146 / 153
» On the Expressibility of Stable Logic Programming
Sort
View
AAAI
2000
14 years 11 months ago
What Sensing Tells Us: Towards a Formal Theory of Testing for Dynamical Systems
Just as actions can have indirect effects on the state of the world, so too can sensing actions have indirect effects on an agent's state of knowledge. In this paper, we inve...
Sheila A. McIlraith, Richard B. Scherl
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
14 years 8 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
IGPL
2010
117views more  IGPL 2010»
14 years 6 months ago
Executable specification of open multi-agent systems
Multi-agent systems where the agents are developed by parties with competing interests, and where there is no access to an agent's internal state, are often classified as `ope...
Alexander Artikis, Marek J. Sergot
COLING
2010
14 years 4 months ago
Knowing What to Believe (when you already know something)
Although much work in NLP has focused on simply determining what a document means, we also must know whether or not to believe it. Fact-finding algorithms attempt to identify the ...
Jeff Pasternack, Dan Roth
ESOP
2005
Springer
15 years 3 months ago
Asserting Bytecode Safety
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
Martin Wildmoser, Tobias Nipkow