Learning to reason with a restricted view
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Journal of the ACM (JACM)
Local search for statistical counting
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Solving crossword puzzles as probabilistic constraint satisfaction
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Initial experiments in stochastic satisfiability
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
ACM Computing Surveys (CSUR)
A probabilistic approach to solving crossword puzzles
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Bayes networks for estimating the number of solutions of constraint networks
Annals of Mathematics and Artificial Intelligence
Stochastic Boolean Satisfiability
Journal of Automated Reasoning
Mini-buckets: A general scheme for bounded inference
Journal of the ACM (JACM)
Complexity results for structure-based causality
Artificial Intelligence
Tree Decompositions with Small Cost
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Disjunctions of Horn Theories and Their Cores
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Counting Satisfying Assignments in 2-SAT and 3-SAT
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On the relative complexity of approximate counting problems
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Determining the Number of Solutions to Binary CSP Instances
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Tree approximation for belief updating
Eighteenth national conference on Artificial intelligence
Comparing phase transitions and peak cost in PP-complete satisfiability problems
Eighteenth national conference on Artificial intelligence
Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
Artificial Intelligence
Complexity results for explanations in the structural-model approach
Artificial Intelligence
Algorithms for four variants of the exact satisfiability problem
Theoretical Computer Science
Counting for Satisfiability by Inverting Resolution
Artificial Intelligence Review
Success-Driven Learning in ATPG for Preimage Computation
IEEE Design & Test
Tree decompositions with small cost
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Probabilistic reasoning for entity & relation recognition
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Naive Bayes models for probability estimation
ICML '05 Proceedings of the 22nd international conference on Machine learning
Machine Learning
The number of independent sets in unicyclic graphs
Discrete Applied Mathematics
Verification of large scale nano systems with unreliable nano devices
Nano, quantum and molecular computing
Towards a dichotomy theorem for the counting constraint satisfaction problem
Information and Computation
Phase transitions of PP-complete satisfiability problems
Discrete Applied Mathematics
On probabilistic inference by weighted model counting
Artificial Intelligence
Expressive probabilistic description logics
Artificial Intelligence
Approximate algorithms for credal networks with binary variables
International Journal of Approximate Reasoning
Understanding the role of noise in stochastic local search: Analysis and experiments
Artificial Intelligence
Learning to assign degrees of belief in relational domains
Machine Learning
Algorithms for Counting 2-Sat Solutions and Colorings with Applications
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Force deployment analysis with generalized grammar
Information Fusion
Just Add Weights: Markov Logic for the Semantic Web
Uncertainty Reasoning for the Semantic Web I
Computing the fault tolerance of multi-agent deployment
Artificial Intelligence
The number of independent sets in unicyclic graphs with a given diameter
Discrete Applied Mathematics
Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice
EMO '09 Proceedings of the 5th International Conference on Evolutionary Multi-Criterion Optimization
Probabilistic databases: diamonds in the dirt
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
An Inductive Logic Programming Approach to Statistical Relational Learning
Proceedings of the 2005 conference on An Inductive Logic Programming Approach to Statistical Relational Learning
Towards efficient sampling: exploiting random walk strategies
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Model counting: a new strategy for obtaining good bounds
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Sound and efficient inference with probabilistic and deterministic dependencies
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Mathematics of Operations Research
Volume Computation for Boolean Combination of Linear Arithmetic Constraints
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
DC-SSAT: a divide-and-conquer approach to solving stochastic satisfiability problems efficiently
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Performing Bayesian inference by weighted model counting
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Discriminative training of Markov logic networks
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Reasoning within fuzzy description logics
Journal of Artificial Intelligence Research
Complexity results and approximation strategies for MAP explanations
Journal of Artificial Intelligence Research
Probabilistic planning via heuristic forward search and weighted model counting
Journal of Artificial Intelligence Research
Solving #SAT and Bayesian inference with backtracking search
Journal of Artificial Intelligence Research
The computational complexity of probabilistic planning
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
The good old Davis-Putnam procedure helps counting models
Journal of Artificial Intelligence Research
From sampling to model counting
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Sampling combinatorial spaces using biased random walks
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Complexity results for structure-based causality
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Phase transitions of PP-complete satisfiability problems
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Counting solutions of CSPs: a structural approach
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
The inferential complexity of Bayesian and credal networks
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Query evaluation over probabilistic XML
The VLDB Journal — The International Journal on Very Large Data Bases
Algorithms for propositional model counting
Journal of Discrete Algorithms
Efficient computation of jointree bounds for systematic MAP search
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
High Performing Algorithms for MAP and Conditional Inference in Markov Logic
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
Tree decompositions with small cost
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
The number of independent sets in unicyclic graphs
Discrete Applied Mathematics
Kernelizations for parameterized counting problems
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Horn upper bounds and renaming
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
A worst-case time upper bound for counting the number of independent sets
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Algorithms for propositional model counting
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Leveraging belief propagation, backtrack search, and statistics for model counting
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Approximating the volume of unions and intersections of high-dimensional geometric objects
Computational Geometry: Theory and Applications
Exploiting problem structure for solution counting
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Probabilistic inductive logic programming
Understanding the scalability of Bayesian network inference using clique tree growth curves
Artificial Intelligence
The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Join-graph propagation algorithms
Journal of Artificial Intelligence Research
Approximate model-based diagnosis using greedy stochastic search
Journal of Artificial Intelligence Research
Journal of Automated Reasoning
The complexity of finding kth most probable explanations in probabilistic networks
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Active tuples-based scheme for bounding posterior beliefs
Journal of Artificial Intelligence Research
Boosting learning and inference in Markov logic through metaheuristics
Applied Intelligence
A novel method for counting models on grid Boolean formulas
MCPR'10 Proceedings of the 2nd Mexican conference on Pattern recognition: Advances in pattern recognition
Binding and cross-modal learning in markov logic networks
ICANNGA'11 Proceedings of the 10th international conference on Adaptive and natural computing algorithms - Volume Part II
Database foundations for scalable RDF processing
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Iterative join-graph propagation
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
MAP complexity results and approximation methods
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
The complexity of plan existence and evaluation in robabilistic domains
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Learning Bayesian nets that perform well
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
On computational complexity of counting fixed points in symmetric boolean graph automata
UC'05 Proceedings of the 4th international conference on Unconventional Computation
An alternative proof that exact inference problem in bayesian belief networks is NP-hard
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
A new approach to model counting
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
On the combination of logical and probabilistic models for information analysis
Applied Intelligence
Annotated Probabilistic Temporal Logic: Approximate Fixpoint Implementation
ACM Transactions on Computational Logic (TOCL)
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
Theoretical Computer Science
Solving #SAT using vertex covers
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Survey: The consequences of eliminating NP solutions
Computer Science Review
P-top-k queries in a probabilistic framework from information extraction models
Computers & Mathematics with Applications
The Multivariate Algorithmic Revolution and Beyond
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A Threshold for a Polynomial Solution of #2SAT
Fundamenta Informaticae - Latin American Workshop on Logic Languages, Algorithms and New Methods of Reasoning (LANMR)
Computing #2SAT and #2UNSAT by binary patterns
MCPR'12 Proceedings of the 4th Mexican conference on Pattern Recognition
The computational complexity of monotonicity in probabilistic networks
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Probabilistic inference and monadic second order logic
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Large Social Networks Can Be Targeted for Viral Marketing with Small Seed Sets
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems
ACM Transactions on Computational Logic (TOCL)
A scalable and nearly uniform generator of SAT witnesses
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
The complexity of the counting constraint satisfaction problem
Journal of the ACM (JACM)
Oblivious bounds on the probability of boolean functions
ACM Transactions on Database Systems (TODS)
Situated incremental natural language understanding using Markov Logic Networks
Computer Speech and Language
Knowledge compilation for model counting: affine decision trees
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A generalization of SAT and #SAT for robust policy evaluation
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
From machine learning to machine reasoning
Machine Learning
Hi-index | 0.00 |