Arrow Research search

Author name cluster

Josh Tenenberg

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
1 author row

Possible papers

2

AIJ Journal 1991 Journal Article

A non-reified temporal logic

  • Fahiem Bacchus
  • Josh Tenenberg
  • Johannes A. Koomen

A temporal logic is presented for reasoning about propositions whose truth values might change as a function of time. The temporal propositions consist of formulae in a sorted first-order logic, with each atomic predicate taking some set of temporal arguments as well as a set of non-temporal arguments. The temporal arguments serve to specify the predicate's dependence on time. By partitioning the terms of the language into two sorts, temporal and non-temporal, time is given a special syntactic and semantic status without having to resort to reification. The benefits of this logic are that it has a clear semantics and a well-studied proof theory. Unlike the first-order logic presented by Shoham, propositions can be expressed and interpreted with respect to any number of temporal arguments, not just with respect to a pair of time points (an interval). We demonstrate the advantages of this flexibility. In addition, nothing is lost by this added flexibility and more standard and usable syntax. To prove this assertion we show that the logic completely subsumes Shoham's temporal logic [19].

Details DOI

AAAI Conference 1986 Conference Paper

Planning with Abstraction

  • Josh Tenenberg

Intelligent problem solvers for complex domains must have the capability of reasoning abstractly about tasks that they are called upon to solve. The method of abstraction presented here allows one to reason analogically and hierarchically, making both the task of formalizing domain theories easier for the system designer, as well as allowing for increased computational efficiencies. It is believed that reasoning about concepts that share structure is essential to improving the performance of automated planning systems by allowing one to apply previous computational effort expended in the solution of one problem to a broad range of new problems.

PDF Details