Switch to: References

Add citations

You must login to add citations.
  1. Developmental Dyslexia: Disorder or Specialization in Exploration?Helen Taylor & Martin David Vestergaard - 2022 - Frontiers in Psychology 13:889245.
    We raise the new possibility that people diagnosed with developmental dyslexia (DD) are specialized in explorative cognitive search, and rather than having a neurocognitive disorder, play an essential role in human adaptation. Most DD research has studied educational difficulties, with theories framing differences in neurocognitive processes as deficits. However, people with DD are also often proposed to have certain strengths – particularly in realms like discovery, invention, and creativity – that deficit-centered theories cannot explain. We investigate whether these strengths reflect (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Duality in permutation state spaces and the dual search algorithm.Uzi Zahavi, Ariel Felner, Robert C. Holte & Jonathan Schaeffer - 2008 - Artificial Intelligence 172 (4-5):514-540.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Refinements to depth-first iterative-deepening search in automatic theorem proving.Xumin Nie & David A. Plaisted - 1989 - Artificial Intelligence 41 (2):223-235.
    Download  
     
    Export citation  
     
    Bookmark  
  • A high-performance explanation-based learning algorithm.Alberto Segre & Charles Elkan - 1994 - Artificial Intelligence 69 (1-2):1-50.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Non-Horn clause logic programming.Xumin Nie - 1997 - Artificial Intelligence 92 (1-2):243-258.
    Download  
     
    Export citation  
     
    Bookmark  
  • Quantitatively relating abstractness to the accuracy of admissible heuristics.Armand Prieditis & Robert Davis - 1995 - Artificial Intelligence 74 (1):165-175.
    Download  
     
    Export citation  
     
    Bookmark  
  • BIDA∗: an improved perimeter search algorithm.Giovanni Manzini - 1995 - Artificial Intelligence 75 (2):347-360.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Algorithm for optimal winner determination in combinatorial auctions.Tuomas Sandholm - 2002 - Artificial Intelligence 135 (1-2):1-54.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • A Hybrid of Search Efficiency Mechanisms: Pruning Learning Heuristic Hybrid.Reza Zamani - 2005 - Journal of Intelligent Systems 14 (4):265-288.
    Download  
     
    Export citation  
     
    Bookmark  
  • An efficient relational deductive system for propositional non-classical logics.Andrea Formisano & Marianna Nicolosi-Asmundo - 2006 - Journal of Applied Non-Classical Logics 16 (3-4):367-408.
    We describe a relational framework that uniformly supports formalization and automated reasoning in varied propositional modal logics. The proof system we propose is a relational variant of the classical Rasiowa-Sikorski proof system. We introduce a compact graph-based representation of formulae and proofs supporting an efficient implementation of the basic inference engine, as well as of a number of refinements. Completeness and soundness results are shown and a Prolog implementation is described.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Learning heuristic functions for large state spaces.Shahab Jabbari Arfaee, Sandra Zilles & Robert C. Holte - 2011 - Artificial Intelligence 175 (16-17):2075-2098.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Performance of linear-space search algorithms.Weixiong Zhang & Richard E. Korf - 1995 - Artificial Intelligence 79 (2):241-292.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Dynamically improved bounds bidirectional search.E. C. Sewell & S. H. Jacobson - 2021 - Artificial Intelligence 291 (C):103405.
    Download  
     
    Export citation  
     
    Bookmark  
  • Batch repair actions for automated troubleshooting.Hilla Shinitzky & Roni Stern - 2020 - Artificial Intelligence 283 (C):103260.
    Download  
     
    Export citation  
     
    Bookmark  
  • Principles of metareasoning.Stuart Russell & Eric Wefald - 1991 - Artificial Intelligence 49 (1-3):361-395.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Speeding up problem solving by abstraction: a graph oriented approach.R. C. Holte, T. Mkadmi, R. M. Zimmer & A. J. MacDonald - 1996 - Artificial Intelligence 85 (1-2):321-361.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Best-first fixed-depth minimax algorithms.Aske Plaat, Jonathan Schaeffer, Wim Pijls & Arie de Bruin - 1996 - Artificial Intelligence 87 (1-2):255-293.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • When is Psychology Research Useful in Artificial Intelligence? A Case for Reducing Computational Complexity in Problem Solving.Sébastien Hélie & Zygmunt Pizlo - 2022 - Topics in Cognitive Science 14 (4):687-701.
    A problem is a situation in which an agent seeks to attain a given goal without knowing how to achieve it. Human problem solving is typically studied as a search in a problem space composed of states (information about the environment) and operators (to move between states). A problem such as playing a game of chess has possible states, and a traveling salesperson problem with as little as 82 cities already has more than different tours (similar to chess). Biological neurons (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Optimal Sokoban solving using pattern databases with specific domain knowledge.André G. Pereira, Marcus Ritt & Luciana S. Buriol - 2015 - Artificial Intelligence 227 (C):52-70.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Computational protein design as an optimization problem.David Allouche, Isabelle André, Sophie Barbe, Jessica Davies, Simon de Givry, George Katsirelos, Barry O'Sullivan, Steve Prestwich, Thomas Schiex & Seydou Traoré - 2014 - Artificial Intelligence 212 (C):59-79.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Conflict-based search for optimal multi-agent pathfinding.Guni Sharon, Roni Stern, Ariel Felner & Nathan R. Sturtevant - 2015 - Artificial Intelligence 219 (C):40-66.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Adopt: asynchronous distributed constraint optimization with quality guarantees.Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe & Makoto Yokoo - 2005 - Artificial Intelligence 161 (1-2):149-180.
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • Planning as search: A quantitative approach.Richard E. Korf - 1987 - Artificial Intelligence 33 (1):65-88.
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • Heuristic search in restricted memory.P. P. Chakrabarti, S. Ghose, A. Acharya & S. C. de Sarkar - 1989 - Artificial Intelligence 41 (2):197-221.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Iterative broadening.Matthew L. Ginsberg & William D. Harvey - 1992 - Artificial Intelligence 55 (2-3):367-383.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • A SIMD approach to parallel heuristic search.Ambuj Mahanti & Charles J. Daniels - 1993 - Artificial Intelligence 60 (2):243-282.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Iterative state-space reduction for flexible computation.Weixiong Zhang - 2001 - Artificial Intelligence 126 (1-2):109-138.
    Download  
     
    Export citation  
     
    Bookmark  
  • Games, computers, and artificial intelligence.Jonathan Schaeffer & H. Jaap van den Herik - 2002 - Artificial Intelligence 134 (1-2):1-7.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Planning as heuristic search.Blai Bonet & Héctor Geffner - 2001 - Artificial Intelligence 129 (1-2):5-33.
    Download  
     
    Export citation  
     
    Bookmark   39 citations  
  • Disjoint pattern database heuristics.Richard E. Korf & Ariel Felner - 2002 - Artificial Intelligence 134 (1-2):9-22.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Time complexity of iterative-deepening-A∗.Richard E. Korf, Michael Reid & Stefan Edelkamp - 2001 - Artificial Intelligence 129 (1-2):199-218.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Depth-first heuristic search on a SIMD machine.Curt Powley, Chris Ferguson & Richard E. Korf - 1993 - Artificial Intelligence 60 (2):199-242.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Controlling the learning process of real-time heuristic search.Masashi Shimbo & Toru Ishida - 2003 - Artificial Intelligence 146 (1):1-41.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On searching explanatory argumentation graphs.Régis Riveret - 2020 - Journal of Applied Non-Classical Logics 30 (2):123-192.
    Cases or examples can be often explained by the interplay of arguments in favour or against their outcomes. This paper addresses the problem of finding explanations for a collection of cases where an explanation is a labelled argumentation graph consistent with the cases, and a case is represented as a statement labelling. The focus is on semi-abstract argumentation graphs specifying attack and subargument relations between arguments, along with particular complete argument labellings taken from probabilistic argumentation where arguments can be excluded. (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Heuristic evaluation functions in artificial intelligence search algorithms.Richard E. Korf - 1995 - Minds and Machines 5 (4):489-498.
    We consider a special case of heuristics, namely numeric heuristic evaluation functions, and their use in artificial intelligence search algorithms. The problems they are applied to fall into three general classes: single-agent path-finding problems, two-player games, and constraint-satisfaction problems. In a single-agent path-finding problem, such as the Fifteen Puzzle or the travelling salesman problem, a single agent searches for a shortest path from an initial state to a goal state. Two-player games, such as chess and checkers, involve an adversarial relationship (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Probably bounded suboptimal heuristic search.Roni Stern, Gal Dreiman & Richard Valenzano - 2019 - Artificial Intelligence 267 (C):39-57.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Anytime search in dynamic graphs.Maxim Likhachev, Dave Ferguson, Geoff Gordon, Anthony Stentz & Sebastian Thrun - 2008 - Artificial Intelligence 172 (14):1613-1643.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Linear-space best-first search.Richard E. Korf - 1993 - Artificial Intelligence 62 (1):41-78.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks.David Poole - 1996 - Artificial Intelligence 88 (1-2):69-100.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Optimal composition of real-time systems.Shlomo Zilberstein & Stuart Russell - 1996 - Artificial Intelligence 82 (1-2):181-213.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Potential-based bounded-cost search and Anytime Non-Parametric A ⁎.Roni Stern, Ariel Felner, Jur van den Berg, Rami Puzis, Rajat Shah & Ken Goldberg - 2014 - Artificial Intelligence 214 (C):1-25.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Maximizing over multiple pattern databases speeds up heuristic search.Robert C. Holte, Ariel Felner, Jack Newton, Ram Meshulam & David Furcy - 2006 - Artificial Intelligence 170 (16-17):1123-1136.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Real-time heuristic search.Richard E. Korf - 1990 - Artificial Intelligence 42 (2-3):189-211.
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • Pruning algorithms for multi-model adversary search.David Carmel & Shaul Markovitch - 1998 - Artificial Intelligence 99 (2):325-355.
    Download  
     
    Export citation  
     
    Bookmark  
  • Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces.Levi H. S. Lelis, Roni Stern, Shahab Jabbari Arfaee, Sandra Zilles, Ariel Felner & Robert C. Holte - 2016 - Artificial Intelligence 230 (C):51-73.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Breadth-first heuristic search.Rong Zhou & Eric A. Hansen - 2006 - Artificial Intelligence 170 (4-5):385-408.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Reducing reexpansions in iterative-deepening search by controlling cutoff bounds.U. K. Sarkar, P. P. Chakrabarti, S. Ghose & S. C. De Sarkar - 1991 - Artificial Intelligence 50 (2):207-221.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Symbolic perimeter abstraction heuristics for cost-optimal planning.Álvaro Torralba, Carlos Linares López & Daniel Borrajo - 2018 - Artificial Intelligence 259 (C):1-31.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Minimal proof search for modal logic k model checking.Abdallah Saffidine - 2012 - In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer. pp. 346--358.
    Download  
     
    Export citation  
     
    Bookmark  
  • Computer Go: An AI oriented survey.Bruno Bouzy & Tristan Cazenave - 2001 - Artificial Intelligence 132 (1):39-103.
    Download  
     
    Export citation  
     
    Bookmark   8 citations