Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Madhura Nirkhe

dblp:82/4906 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 1997
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-authorTheory of computation · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Knowledge representation and reasoning · 56% Planning, search and constraint satisfaction · 44%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning
qualitative reasoning
0.011994
Time-Situated Reasoning within Tight Deadlines and Realistic Space and Computation Bounds · AAAI 1994
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning › constraint-based planning
resource-constrained planning
0.011994
Time-Situated Reasoning within Tight Deadlines and Realistic Space and Computation Bounds · AAAI 1994
Knowledge, reasoning and agents › Knowledge representation and reasoning
temporal reasoning
0.011994
Time-Situated Reasoning within Tight Deadlines and Realistic Space and Computation Bounds · AAAI 1994

Methods — techniques the papers use, named apart from their topics

qualitative reasoning · 0.0anytime reasoning · 0.0
YearPublicationVenuePosition
1997 How to (Plan to) Meet a Deadline between Now and Then
abstract
In planning situations involving tight deadlines, a commonsense reasoner may spend a substantial amount of the available time in reasoning towards and about the formulation of the (partial) plan. This reasoning involves, but is not limited to (partial) plan formulation, asking decisions about available and conceivable alternatives, plan sequecing, and also plan failure and revision. However, the time taken in reasoning about a plan brings the deadline closer. The reasoner should therefore take account of the passage of time during that same reasoning, and this accounting must continously affect every decision under time-pressure. Step-logics were introduced as a mechanism for reasoning situated in time. We employ an extension of them here, called ‘active logics’, to create a logic-based planner that lets a time-situated reasoner keep track of a approaching deadline as he/she makes (and enacts) his/her plan, thereby treatilng all facets of planning (including plan-formation and its simultaneous of subsequent execution) as deadline-coupled. While an agent under severe time-pressure may spend a substantial amount of the available time in reasoning towards and about a plan of action, in a realistic setting the same agent must also measure up to two other crucial resource limitations as well, namely space and computation bounds. We address these concerns and offer some solution by introducing a limited short-term memory combined with a primitive relevance mechanism, and a limited-capacity inference engine. We propose heuristics to maximize an agent's chances of meeting a dedline within these additional realistic constraints. We give examples from commonsense planning, including ones we have solved and implemented in Prolog.
Madhura Nirkhe, Sarit Kraus, Michael J. Miller, Donald Perlis
J. Log. Comput.1
1995 Formal Real-Time Imagination
abstract
Formal real-time imagination is a term that may curiously describe the activities of a commonsense agent in a real-time setting in general, and in a tight deadline situation in particular. We briefly describe an ‘active-logic’ mechanism that fits this description. Temporal projection is an essential component of realtime planning. We draw a parallel between imagination as we understand it in human context and the capacity of the automated agent to formulate mental images of possible scenarios and plans of action in the course of its reasoning. We outline a treatment of temporal issues of significance to a time-situated reasoning mechanism in a dynamic setting with deadlines. The Yale shooting problem is a benchmark problem in temporal reasoning. We demonstrate how the active-logic planning mechanism successfully handles some interesting real-time variants of the Yale shooting problem. The solutions to each of these illustrate the agent’s ability to form contexts within which to reason, to project in each context thus formed by applying default inferences, and to revise and extend its conclusions within each context by applying time-sensitive inference rules, and most importantly, to account for all the time spent in the process.
Madhura Nirkhe, Sarit Kraus
Fundam. Informaticae1
1994 Time-Situated Reasoning within Tight Deadlines and Realistic Space and Computation Bounds
Madhura Nirkhe
AAAI1
1991 Fully Deadline-Coupled Planning: One Step at a Time
Madhura Nirkhe, Sarit Kraus, Donald Perlis
ISMIS1