scientific article; zbMATH DE number 1114005
From MaRDI portal
Publication:4375773
zbMATH Open0891.68100MaRDI QIDQ4375773FDOQ4375773
Authors: Yueyen Jiang, Henry Kautz, Bart Selman 
Publication date: 2 March 1998
Title of this publication is not available (Why is that?)
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18) Boolean programming (90C09)
Cited In (19)
- Stochastic Simulation on Integer Constraint Sets
- Approximate algorithms for generalized maximum utility problems
- Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language +
- A taxonomy of weight learning methods for statistical relational learning
- A taxonomy of exact methods for partial Max-SAT
- Stochastic constraint programming: A scenario-based approach
- Worst-case study of local search for MAX-\(k\)-SAT.
- A new approach for weighted constraint satisfaction
- Probabilistic event calculus for event recognition
- Title not available (Why is that?)
- Markov logic networks
- Solutions for hard and soft constraints using optimized probabilistic satisfiability
- State space search with prioritised soft constraints
- Learning hierarchical probabilistic logic programs
- Lifted graphical models: a survey
- Leveraging cluster backbones for improving MAP inference in statistical relational models
- Learning action models from plan examples using weighted MAX-SAT
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375773)
