Sciweavers

1194 search results - page 114 / 239
» A Language for Implementing Arbitrary Logics
Sort
View
ATAL
2008
Springer
13 years 11 months ago
Verifying Social Expectations by Model Checking Truncated Paths
One approach to moderating the expected behaviour of agents in open societies is the use of explicit languages for defining norms, conditional commitments and/or social expectation...
Stephen Cranefield, Michael Winikoff
IJIT
2004
13 years 10 months ago
Rule-Based Message Passing for Collaborative Application in Distributed Environments
In this paper, we describe a rule-based message passing method to support developing collaborative applications, in which multiple users share resources in distributed environments...
Wataru Yamazaki, Hironori Hiraishi, Fumio Mizoguch...
IJCAI
1993
13 years 10 months ago
Notes on Formalizing Context
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c, p). It asserts that the proposition p is true in the context c. The most important f...
John McCarthy
ICMLA
2009
13 years 7 months ago
Learning Parameters for Relational Probabilistic Models with Noisy-Or Combining Rule
Languages that combine predicate logic with probabilities are needed to succinctly represent knowledge in many real-world domains. We consider a formalism based on universally qua...
Sriraam Natarajan, Prasad Tadepalli, Gautam Kunapu...
ATVA
2007
Springer
152views Hardware» more  ATVA 2007»
14 years 3 months ago
Bounded Synthesis
Abstract. The bounded synthesis problem is to construct an implementation that satisfies a given temporal specification and a given bound on the number of states. We present a so...
Sven Schewe, Bernd Finkbeiner