 | Pac-Learning Recursive Logic Programs: Efficient Algorithms - W. W. Cohen (vol 2, 1995) |
| Pac-learning Recursive Logic Programs: Negative Results - W. W. Cohen (vol 2, 1995) |
| Parameter Learning of Logic Programs for Symbolic-Statistical Modeling - T. Sato and Y. Kameya (vol 15, 2001) |
| Partial-Order Planning with Concurrent Interacting Actions - C. Boutilier and R. I. Brafman (vol 14, 2001) |
| Pattern Matching and Discourse Processing in Information Extraction from Japanese Text - T. Kitani, Y. Eriguchi and M. Hara (vol 2, 1994) |
| PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains - M. Fox and D. Long (vol 20, 2003) |
| PDDL 2.1: Representation vs. Computation - H. A. Geffner (vol 20, 2003) |
| PDDL2.1 -- The Art of the Possible? Commentary on Fox and Long - D. McDermott (vol 20, 2003) |
| Perseus: Randomized Point-based Value Iteration for POMDPs - M. T.J. Spaan and N. Vlassis (vol 24, 2005) |
| A Personalized System for Conversational Recommendations - C. A. Thompson, M. H. Goker and P. Langley (vol 21, 2004) |
| PHA*: Finding the Shortest Path with A* in An Unknown Physical Environment - A. Felner, R. Stern, A. Ben-Yair, S. Kraus and N. Netanyahu (vol 21, 2004) |
| Phase Transitions and Backbones of the Asymmetric Traveling Salesman Problem - W. Zhang (vol 21, 2004) |
| Planning by Rewriting - J. L. Ambite and C. A. Knoblock (vol 15, 2001) |
| Planning for Contingencies: A Decision-based Approach - L. Pryor and G. Collins (vol 4, 1996) |
| Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan - S. Kambhampati (vol 12, 2000) |
| Planning Graph Heuristics for Belief Space Search - D. Bryce, S. Kambhampati and D. E. Smith (vol 26, 2006) |
| Planning Through Stochastic Local Search and Temporal Action Graphs in LPG - A. Gerevini, A. Saetti and I. Serina (vol 20, 2003) |
| Policy Recognition in the Abstract Hidden Markov Model - H. H. Bui, S. Venkatesh and G. West (vol 17, 2002) |
| Popular Ensemble Methods: An Empirical Study - D. Opitz and R. Maclin (vol 11, 1999) |
| Potential-Based Shaping and Q-Value Initialization are Equivalent - E. Wiewiora (vol 19, 2003) |
| The Power of Modeling---a Response to PDDL2.1 - F. Bacchus (vol 20, 2003) |
| Practical Methods for Proving Termination of General Logic Programs - E. Marchiori (vol 4, 1996) |
| Preference-based Search using Example-Critiquing with Suggestions - P. Viappiani, B. Faltings and P. Pu (vol 27, 2006) |
| Price Prediction in a Trading Agent Competition - M. P. Wellman, D. M. Reeves, K. M. Lochner and Y. Vorobeychik (vol 21, 2004) |
| A Principled Approach Towards Symbolic Geometric Constraint Satisfaction - S. Bhansali, G. A. Kramer and T. J. Hoar (vol 4, 1996) |
| Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations - J. C. Beck and N. Wilson (vol 28, 2007) |
| Probabilistic Deduction with Conditional Constraints over Basic Events - T. Lukasiewicz (vol 10, 1999) |
| Probabilistic Hybrid Action Models for Predicting Concurrent Percept-driven Robot Behavior - M. Beetz and H. Grosskreutz (vol 24, 2005) |
| Probabilistic Inference from Arbitrary Uncertainty using Mixtures of Factorized Generalized Gaussians - A. Ruiz, P. E. Lopez-de-Teruel and M. C. Garrido (vol 9, 1998) |
| Properties and Applications of Programs with Monotone and Convex Constraints - L. Liu and M. Truszczynski (vol 27, 2006) |
| Propositional Independence - Formula-Variable Independence andForgetting - J. Lang, P. Liberatore and P. Marquis (vol 18, 2003) |
| Provably Bounded-Optimal Agents - S. J. Russell and D. Subramanian (vol 2, 1995) |
| Pure Nash Equilibria: Hard and Easy Games - G. Gottlob, G. Greco and F. Scarcello (vol 24, 2005) |