Sciweavers

91 search results - page 14 / 19
» Representing the Adverb Very in Fuzzy Set Theory
Sort
View
DALT
2005
Springer
14 years 28 days ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
RTA
2010
Springer
13 years 11 months ago
Computing Critical Pairs in 2-Dimensional Rewriting Systems
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
Samuel Mimram
AAAI
2008
13 years 8 months ago
Reasoning about Large Taxonomies of Actions
We design a representation based on the situation calculus to facilitate development, maintenance and elaboration of very large taxonomies of actions. This representation leads to...
Yilan Gu, Mikhail Soutchanski
KR
2004
Springer
14 years 23 days ago
Knowledge Discovery by Reversing Inductive Knowledge Representation
In a very basic sense, the aim of knowledge discovery is to reveal structures of knowledge which can be seen as being represented by structural relationships. In this paper, we ma...
Gabriele Kern-Isberner, Jens Fisseler
HEURISTICS
2006
102views more  HEURISTICS 2006»
13 years 7 months ago
A logic of soft constraints based on partially ordered preferences
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
Nic Wilson