Abstract is missing.
- Explicit Logics of Knowledge and ConservativityMelvin Fitting. [doi]
- Approximation Strategies for Routing in Stochastic Dynamic NetworksTomás Singliar, Milos Hauskrecht. [doi]
- Exploiting Conjunctive Queries in Description Logic ProgramsThomas Eiter, Thomas Krennwallner, Roman Schindlauer, Giovambattista Ianni. [doi]
- A Bayesian Approach to Cluster ValidationHoyt A. Koepke, Bertrand S. Clarke. [doi]
- Formalising Interaction-Situated Semantic Alignment: The Communication ProductManuel Atencia, W. Marco Schorlemmer. [doi]
- Practical Methods for Exploiting Bounds on Change in the MarginAndrew Guillory, Jeff Bilmes. [doi]
- Continuous-State POMDPs with Hybrid DynamicsEmma Brunskill, Leslie Pack Kaelbling, Tomás Lozano-Pérez, Nicholas Roy. [doi]
- Order-based Discriminative Structure Learning for Bayesian Network ClassifiersFranz Pernkopf, Jeff Bilmes. [doi]
- Best-First Search with Maximum Edge Cost FunctionsP. Alex Dow, Richard E. Korf. [doi]
- Extracting Relevant Information from SamplesNaftali Tishby. [doi]
- Combinatorial problems for Horn clausesMarina Langlois, Dhruv Mubayi, Robert H. Sloan, György Turán. [doi]
- Active Collaborative Prediction with Maximum Margin Matrix FactorizationIrina Rish, Gerald Tesauro. [doi]
- Probabilistic Sequential Diagnosis by CompilationSajjad Ahmed Siddiqi, Jinbo Huang. [doi]
- Approximation Techniques for Space-Efficient Compilation in Abductive InferenceGregory Provan. [doi]
- Sampling for Approximate Inference in Continuous Time Bayesian NetworksYu Fan, Christian R. Shelton. [doi]
- Scalable Action Respecting EmbeddingMichael Biggs, Ali Ghodsi, Dana F. Wilkinson, Michael H. Bowling. [doi]
- A Successive Approximation Algorithm for Coordination ProblemsMarek Petrik, Shlomo Zilberstein. [doi]
- Efficient Value-Function Approximation via Online Linear RegressionLihong Li, Michael L. Littman. [doi]
- Reinforcement Learning with Limited Reinforcement: Using Bayes Risk for Active Learning in POMDPsFinale Doshi, Joelle Pineau, Nicholas Roy. [doi]
- Optimality Conditions for Distributive JusticeJohn N. Hooker. [doi]
- An Interpretation of Consistent Belief Functions in Terms of Simplicial ComplexesFabio Cuzzolin. [doi]
- Lifting Techniques for Weighted Constraint Satisfaction ProblemsT. K. Satish Kumar. [doi]
- Approximate Solutions of Interactive POMDPs Using Point Based Value IterationDennis Perez, Prashant Doshi. [doi]
- Default Logic Generalized and SimplifiedAlex Bochman. [doi]
- Predictive Linear-Gaussian Models of Dynamical Systems with Vector-Valued Actions and ObservationsMatthew R. Rudary, Satinder P. Singh. [doi]
- Integrating Answer Programming and Constraint Logic ProgrammingVeena S. Mellarkod, Michael Gelfond, Yuanlin Zhang. [doi]
- Building Incomplete but Accurate ModelsErik Talvitie, Britton Wolfe, Satinder Singh. [doi]
- Hard SAT and CSP instances with Expander GraphsCarlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu. [doi]
- Bayes-Adaptive POMDPs: A New Perspective on the Explore-Exploit Tradeoff in Partially Observable DomainsJoelle Pineau, Stéphane Ross, Brahim Chaib-draa. [doi]
- Stable Models and Difference LogicIlkka Niemelä. [doi]
- Minimal Residual Approaches for Policy Evaluation in Large Sparse Markov ChainsHengshuai Yao, Zhi-Qiang Liu. [doi]
- Using Abstraction for Generalized PlanningSiddharth Srivastava, Neil Immerman, Shlomo Zilberstein. [doi]
- A General Agnostic Active Learning AlgorithmSanjoy Dasgupta, Daniel Hsu, Claire Monteleoni. [doi]
- Boolean and Matroidal Independence in Uncertainty TheoryFabio Cuzzolin. [doi]
- Probably Approximately Correct (PAC) Exploration in Reinforcement LearningAlexander L. Strehl. [doi]
- Estimating the Number of Local Maxima for k-SAT InstancesAndreas Alexander Albrecht, Peter C. R. Lane, Kathleen Steinhöfel. [doi]
- A Fast Way to Produce Optimal Fixed-Depth Decision TreesAlireza Farhangfar, Russell Greiner, Martin Zinkevich. [doi]
- Extending the Bellman equation for MDPs to continuous actions and cont. time in the discounted caseEmmanuel Rachelson, Frédérick Garcia, Patrick Fabiani. [doi]
- Model-based Bayesian Reinforcement Learning in Partially Observable DomainsPascal Poupart, Nikos A. Vlassis. [doi]
- On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic SatisfiabilityEmad Saad. [doi]
- Leveraging Belief Propagation, Backtrack Search, and Statistics for Model CountingLukas Kroc, Bart Selman, Ashish Sabharwal. [doi]
- Hyperequivalence of Programs and OperatorsMiroslaw Truszczynski, Stefan Woltran. [doi]
- A Non-Preferential Semantics of Non-Monotonic Modal LogicMichael Kaminski. [doi]
- More Flexible Term Schematisations via Extended Primal GrammarsVincent Aravantinos, Ricardo Caferra, Nicolas Peltier. [doi]
- Complexity of First Order ID-LogicJohn S. Schlipf, Marc Denecker. [doi]
- SAT as a Programming Environment for Linear Algebra and CryptanalysisMarian Srebrny, Mateusz Srebrny, Lidia Stepien. [doi]
- A Connection between Cantor-Bendixson Derivatives and the Well-Founded Semantics of Logic ProgramsDouglas Cenzer, Jeffrey B. Remmel. [doi]
- Classifier Utility Visualization by Distance-Preserving Projection of High Dimensional Performance DNathalie Japkowicz, Pritika Sanghi, Peter E. Tischer. [doi]
- Solving Structured Continuous-Time Markov Decision ProcessesKin Fai Kan, Christian R. Shelton. [doi]
- Preferences, Constraints, Uncertainty, and Multi-Agent ScenariosFrancesca Rossi. [doi]
- Planning Aims for a Network of Horizontal and Overhead SensorsErik Halvorson, Ronald Parr. [doi]
- Paired Sampling in Density-Sensitive Active LearningPinar Donmez, Jaime G. Carbonell. [doi]
- Rare Class Discovery Based on Active LearningJingrui He, Jaime G. Carbonell. [doi]
- A Mathematician Looks at Answer Set ProgrammingJeffrey B. Remmel. [doi]
- A Lazy Approach to Online Learning with ConstraintsBranislav Kveton, Jia Yuan Yu, Georgios Theocharous, Shie Mannor. [doi]
- Complexity Issues in Preference Elicitation and ManipulationToby Walsh. [doi]
- Comparing Multiagent Systems Research in Combinatorial Auctions and VotingVincent Conitzer. [doi]
- Hybrid Programs: Symmetrically Combining Natively Discrete and Continuous Truth-valuesHoward A. Blair, David W. Jakel, Robert J. Irwin, A. J. Rivera. [doi]
- From Hilbert's Program to a Logic ToolboxJohann A. Makowsky. [doi]
- Verifying RUP Proofs of Propositional UnsatisfiabilityAllen Van Gelder. [doi]
- Tradeoffs in Backdoors: Inconsistency Detection, Dynamic Simplification, and PreprocessingBistra N. Dilkina, Carla P. Gomes, Ashish Sabharwal. [doi]