Artificial Intelligence: From programs to solvers

@article{Geffner2014ArtificialIF,
  title={Artificial Intelligence: From programs to solvers},
  author={Hector Geffner},
  journal={AI Commun.},
  year={2014},
  volume={27},
  pages={45-51}
}
Artificial Intelligence is a brain child of Alan Turing and his universal programmable computer. During the 60’s and 70’s, AI researchers used computers for exploring intuitions about intelligence and for writing programs displaying intelligent behavior. A significant change occurred however in the 80’s, as many AI researchers moved from the early AI paradigm of writing programs for ill-defined problems to writing solvers for well-defined mathematical models like Constraint Satisfaction… 

Statistical Relational Artificial Intelligence: From Distributions through Actions to Optimization

The intention here is to give a brief (and necessarily incomplete) overview and invitation to the emerging field of Statistical Relational AI from the perspective of acting optimally and learning to act.

Statistical Relational Artificial Intelligence: Logic, Probability, and Computation

This book focuses on two representations in detail: Markov logic networks, a relational extension of undirected graphical models and weighted first-order predicate calculus formula, and Problog, a probabilistic extension of logic programs that can also be viewed as a Turing-complete relational extensions of Bayesian networks.

A Concise Introduction to Models and Methods for Automated Planning

The goal is to provide a modern and coherent view of planning that is precise, concise, and mostly self-contained, without being shallow.

Relational Linear Programs

RLP's relational nature allows a more intuitive representation of optimization problems over relational domains, and is illustrated empirically by experiments on approximate inference in Markov logic networks using LP relaxations, on solving Markov decision processes, and on collective inference using LP support vector machines.

Target Languages (vs. Inductive Biases) for Learning to Act and Plan

A different learning approach where representations do not emerge from biases in a neural architecture but are learned over a given target language with a known semantics, to make these ideas explicit and to illustrate them in the context of learning to act and plan.

Width-Based Planning for General Video-Game Playing

This paper uses the IW(1) algorithm for selecting actions in the games of the general video-game AI competition (GVG-AI), which, unlike classical planning problems and the Atari games, are stochastic.

Hierarchical Planning in the IPC

This paper proposes to create a new track for the IPC in which hierarchical planners will compete, which will result in a standardised description language, broader support for core features of that language among planners, a set of benchmark problems, a means to fairly and objectively compare HTN planners, and for new challenges for planners.

Benchmarks Old and New : How to compare domain independence for cost-optimal classical planning ?

This paper compares the best performing, non-portfolio planners from the cost-optimal classical track of the International Planning Competition (IPC) 2018 on the complete set of benchmarks from the previous two competitions and on a subset of the competitions from before 2011.

References

SHOWING 1-10 OF 68 REFERENCES

SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE

Steps toward Artificial Intelligence

  • M. Minsky
  • Computer Science
    Proceedings of the IRE
  • 1961
The discussion is supported by extensive citation of the literature and by descriptions of a few of the most successful heuristic (problem-solving) programs constructed to date.

Computers and Thought

Computers and Thought showcases the work of the scientists who not only defined the field of Artificial Intelligence, but who are responsible for having developed it into what it is today. Originally

Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications

This collection of papers on all theoretical and practical aspects of SAT solving will be extremely useful to both students and researchers and will lead to many further advances in the field.

Computational models of planning.

  • Hector Geffner
  • Computer Science
    Wiley interdisciplinary reviews. Cognitive science
  • 2013
This paper looks at several planning models, at methods that have been shown to scale up to large problems, and at what these methods may suggest about the human mind.

Artificial Intelligence: A Modern Approach

The long-anticipated revision of this #1 selling book offers the most comprehensive, state of the art introduction to the theory and practice of artificial intelligence for modern applications.

What computers still can't do - a critique of artificial reason

For this edition of What Computers Can't Do, Hubert Dreyfus has added a lengthy new introduction outlining changes and assessing the paradigms of connectionism and neural networks that have transformed the field.

Learning Generalized Policies in Planning Using Concept Languages

This paper represents generalized policies in a diierent way using a concept language and shows through a number of experiments in the blocks-world that the concept language yields a better policy using a smaller set of examples and no background knowledge.

Performing Bayesian Inference by Weighted Model Counting

An efficient translation from Bayesian networks to weighted model counting, extend the best model-counting algorithms to weightedmodel counting, develop an efficient method for computing all marginals in a single counting pass, and evaluate the approach on computationally challenging reasoning problems.

Intelligence without Representation

...