Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
This paper analyzes a language for actions and the deontic modalities over actions -- i.e., the modalities permitted, forbidden and obligatory. The work is based on: (1) an action...
We propose to extend the ontology of logical AI to include approximate objects, approximate predicates and approximate theories. Besides the ontology we treat the relations among ...
In this paper I give a brief overview of recent work on uncertainty inAI, and relate it to logical representations. Bayesian decision theory and logic are both normative frameworks...
We consider the frame problem, that is, char acterizing the assumption that properties tend to persist over time. We show that there are at least three distinct assumptions that...