Sciweavers

155 search results - page 28 / 31
» Foundations of a Logical Approach to Agent Programming
Sort
View
KBSE
2010
IEEE
13 years 5 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
SYNTHESE
2011
239views more  SYNTHESE 2011»
13 years 2 months ago
Carnap on theoretical terms: structuralism without metaphysics
: Both realists and instrumentalists have found it difficult to understand (much less accept) Carnap’s developed view on theoretical terms, which attempts to stake out a neutral ...
Michael Friedman
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
14 years 9 days ago
Typed compilation of recursive datatypes
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, K...
ATAL
2010
Springer
13 years 8 months ago
Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mod...
Zhengyu Yin, Dmytro Korzhyk, Christopher Kiekintve...
ILP
2007
Springer
14 years 1 months ago
Learning to Assign Degrees of Belief in Relational Domains
A recurrent question in the design of intelligent agents is how to assign degrees of beliefs, or subjective probabilities, to various events in a relational environment. In the sta...
Frédéric Koriche