Sciweavers

3571 search results - page 169 / 715
» Cohen and Set Theory
Sort
View
AAAI
2007
15 years 8 months ago
Computational Aspects of Covering in Dominance Graphs
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
Felix Brandt, Felix A. Fischer
LATA
2009
Springer
16 years 1 months ago
Tiling the Plane with a Fixed Number of Polyominoes
Deciding whether a finite set of polyominoes tiles the plane is undecidable by reduction from the Domino problem. In this paper, we prove that the problem remains undecidable if t...
Nicolas Ollinger
ICFP
2005
ACM
16 years 6 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...
AIML
1998
15 years 8 months ago
Propositions, Propositional Attitudes and Belief Revision
In this paper I will propose a new approach to certain semantic puzzles due to Frege, Kripke and others, and the question of propositional attitudes, via the notion of belief revi...
Rohit Parikh
ENTCS
2002
112views more  ENTCS 2002»
15 years 6 months ago
Ambient Calculus and its Logic in the Calculus of Inductive Constructions
The Ambient Calculus has been recently proposed as a model of mobility of agents in a dynamically changing hierarchy of domains. In this paper, we describe the implementation of t...
Ivan Scagnetto, Marino Miculan