scispace - formally typeset
Search or ask a question

Showing papers in "Artificial Intelligence in 2003"


Journal ArticleDOI
TL;DR: The essay reviews recent work in Embodied Cognition, provides a concise guide to its principles, attitudes and goals, and identifies the physical grounding project as its central research focus.

982 citations


Journal ArticleDOI
TL;DR: An empirical study is conducted to examine the pros and cons of these search methods, give some guidelines on choosing a search method, and compare the classifier error rates before and after feature selection.

846 citations


Journal Article
TL;DR: A novel linear algorithm is presented that enables software agents to make trade-offs for multi-dimensional goods for the problem of distributed resource allocation and can operate in the presence of varying degrees of uncertainty.

557 citations


Journal ArticleDOI
TL;DR: This paper formally characterize different planning problems, where solutions have a chance of success, are guaranteed to achieve the goal, or achieve; the goal with iterative trial-and-error strategies ("strong cyclic planning"), and presents planning algorithms for these problem classes.

359 citations


Journal ArticleDOI
TL;DR: The generalization of bisimulation to stochastic processes yields a non-trivial notion of state equivalence that guarantees the optimal policy for the reduced model immediately induces a corresponding Optimal Policy for the original model.

354 citations


Journal Article
TL;DR: The STARD project group has developed a single-page checklist, which contains a clarification of the meaning, rationale, and optimal use of each item on the checklist, as well as a short summary of the available evidence on bias and applicability.

341 citations


Journal ArticleDOI
TL;DR: This paper develops a fuzzy constraint based model for bilateral multi-issue negotiation in trading environments in which agents seek to strike a fair deal for both parties, but which, nevertheless, maximises their own payoff.

334 citations


Journal ArticleDOI
TL;DR: Two new mechanisms which direct visual attention in the proposed object-based visual attention system are object-driven as well as feature-driven, and the first mechanism computes the visual salience of objects and groupings and implements the hierarchical selectivity of attentional shifts.

333 citations


Journal ArticleDOI
TL;DR: The work is an extension of Reiter's approach to the frame problem for ordinary actions and Moore's work on knowledge and action and shows that a form of regression examined by Reiter for reducing reasoning about future situations to reasoning about the initial situation now also applies to knowledge-producing actions.

312 citations


Journal ArticleDOI
TL;DR: A complexity analysis of planning under uncertainty is presented, showing the "probabilistic classical planning" problem to be formally undecidable and any problem statement where the agent operates over an infinite or indefinite time horizon, and has available only probabilistic information about the system's state.

273 citations


Journal ArticleDOI
TL;DR: A formal model of reasoning with cases which captures many of the insights from previous work is put forward, and extensions to the basic model are discussed to accommodate particular features of previous work.

Journal ArticleDOI
Philippe Laborie1
TL;DR: Two new algorithms to propagate resource constraints on discrete resources and reservoirs are described that focus on the precedence relations between activities rather than on their absolute position in time, which explains why these algorithms are particularly suited for integrated planning and scheduling approaches.

Journal ArticleDOI
TL;DR: The first step towards a systematic comparative study among different EAs and their first hitting times has been made in the paper, and the framework is built on the absorbing Markov chain model of evolutionary algorithms.

Journal ArticleDOI
TL;DR: Although it is rare for AI papers to present negative results, it is believed that useful lessons can be learned from STOP and the AI community as a whole could benefit from considering the issue of how, when, and why negative results should be reported.

Journal ArticleDOI
TL;DR: An evaluation study showed that arguments about the significance of distinctions based on this model help predict the outcome of cases in the area of trade secrets law, confirming the quality of these arguments.

Journal ArticleDOI
Churn-Jung Liau1
TL;DR: By use of modal logic, the relationship among belief, information acquisition and trust is semantically and axiomatically characterized and the applications of the logic to computer security and database reasoning are suggested.

Journal ArticleDOI
TL;DR: This guide is a guide to a field which aims to identify that field’s general principles and properties, and the impact that embodiment can have on the task of creating artificial intelligent agents is restricted to embodied artificial intelligence (EAI).

Journal ArticleDOI
TL;DR: A more sophisticated search algorithm for optimal (and anytime) winner determination is presented, including structural improvements that reduce search tree size, faster data structures, and optimizations at search nodes based on driving toward, identifying and solving tractable special cases.

Journal ArticleDOI
TL;DR: This work identifies a common transportation theme shared by the majority of the benchmarks and uses this observation to define and analyze a general transportation problem that generalizes planning in several classical domains such as LOGISTICS, MYSTERY and GRIPPER.

Journal ArticleDOI
TL;DR: The present paper discusses experimental argument assistance tools, ARGUE! and ARGUMED based on DEFLOG, which provide insights into the design of argument assistants, and show the pros and cons of different ways of representing argumentative data.

Journal ArticleDOI
TL;DR: The original Darwiche-Pearl approach is shown to be excessively strong and rather limited in scope, and a dynamic revision operator is provided via entrenchment kinematics as well as a simple form of lexicographic revision.

Journal ArticleDOI
TL;DR: A framework for solving CSPs based both on backtracking techniques and on the notion of tree-decomposition of the constraint networks is proposed, which will benefit from the advantages of two approaches: a practical efficiency of enumerative algorithms and a warranty of a limited time complexity by an approximation of the tree-width of the constraints networks.

Journal ArticleDOI
TL;DR: A new algorithm is presented, called Epilitis, which integrates strategies for efficient DTP solving from the previous literature, including conflictdirected backjumping, removal of subsumed variables, and semantic branching, and further adds no-good recording as a central technique and can achieve a nearly two order-of-magnitude speed-up over previously published algorithms on benchmark problems in the DTP literature.

Journal ArticleDOI
TL;DR: The results indicate that, thanks to the power of knowledge-state problem encoding, the DLVK system is competitive even with special purpose conformant planning systems, and it often supplies a more natural and simple representation of the planning problems.

Journal ArticleDOI
TL;DR: It is proved that the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width is NP-hard to solve exactly and an approximation algorithm with a provable performance guarantee is provided.

Journal ArticleDOI
TL;DR: This paper introduces an axiom of ordinal invariance requiring that the Decision Maker's preference between two acts only depends on the relative position of their consequences for each state, and determines the only possible form of the corresponding decision rule.

Journal ArticleDOI
TL;DR: In this article, a general semantic approach to autoepistemic and default logics is developed, based on the notion of a belief pair and exploiting the lattice structure of the collection of all belief pairs.

Journal ArticleDOI
TL;DR: Two new probabilistic planning techniques are described-- c-MAXPLAN and ZANDER--that generate contingent plans in Probabilistic propositional domains that operate by transforming the planning problem into a stochastic satisfiability problem and solving that problem instead.

Journal ArticleDOI
TL;DR: This paper shows that no RCC model can be interpreted extensionally anyway and hence give a negative answer to a conjecture raised by Bennett, and attaches to each cell entry in the RCC8 CT a superscript to indicate in what circumstances an extensional interpretation is possible.

Journal ArticleDOI
TL;DR: A model of problem difficulty for tabu search in the JSP is developed, borrowing from similar models developed for SAT and other NP-complete problems, and it is shown that the mean distance between random local optima and the nearest optimal solution is highly correlated with the cost of locating optimal solutions to typical, random JSPs.