Nina Narodytska

Nicholas Asher

Proceedings of the AIxIA 2020 - Advances in Artificial Intelligence, 2020

2019

Automating Cluster Management with Weave.

[BibT_eX]

[DOI]

CoRR, 2019

On Validating, Repairing and Refining Heuristic ML Explanations.

[BibT_eX]

[DOI]

CoRR, 2019

Assessing Heuristic Machine Learning Explanations with Model Counting.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

Simple and precise static analysis of untrusted Linux kernel extensions.

[BibT_eX]

[DOI]

Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

On Relating Explanations and Adversarial Examples.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

RelGAN: Relational Generative Adversarial Networks for Text Generation.

[BibT_eX]

[DOI]

Weili Nie

Ankit Patel

Proceedings of the 7th International Conference on Learning Representations, 2019

Synthesizing Cluster Management Code for Distributed Systems.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Hot Topics in Operating Systems, 2019

BDD-Based Algorithms for Packet Classification.

[BibT_eX]

[DOI]

Proceedings of the 2019 Formal Methods in Computer Aided Design, 2019

Abduction-Based Explanations for Machine Learning Models.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Automated Verification of Neural Networks: Advances, Challenges and Perspectives.

[BibT_eX]

[DOI]

CoRR, 2018

Constrained Image Generation Using Binarized Neural Networks with Decision Procedures.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

Learning Optimal Decision Trees with SAT.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Core-Guided Minimal Correction Set and Core Enumeration.

[BibT_eX]

[DOI]

Maria-Cristina V. Marinescu

Nikolaj S. Bjørner

Mooly Sagiv

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Formal Analysis of Deep Binarized Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Network Approximation using Tensor Sketching.

[BibT_eX]

[DOI]

Hongxia Jin

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Formal Verification of Deep Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the 2018 Formal Methods in Computer Aided Design, 2018

A SAT-Based Approach to Learn Explainable Decision Sets.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

Verifying Properties of Binarized Deep Neural Networks.

[BibT_eX]

[DOI]

Leonid Ryzhyk

Mooly Sagiv

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Deep Neural Network Approximation using Tensor Sketching.

[BibT_eX]

[DOI]

Hongxia Jin

CoRR, 2017

Simple Black-Box Adversarial Attacks on Deep Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops, 2017

2016

New Approaches to Constraint Acquisition.

[BibT_eX]

[DOI]

Proceedings of the Data Mining and Constraint Programming, 2016

Simple Black-Box Adversarial Perturbations for Deep Networks.

[BibT_eX]

[DOI]

CoRR, 2016

The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Fifth Workshop on Synthesis, 2016

Three generalizations of the FOCUS constraint.

[BibT_eX]

[DOI]

Constraints An Int. J., 2016

Adaptive Condorcet-Based Stopping Rules Can Be Efficient.

[BibT_eX]

[DOI]

Omer Reingold

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

A SAT-Based Counterexample Guided Method for Unbounded Synthesis.

[BibT_eX]

[DOI]

Alexander Legg

Leonid Ryzhyk

Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015

Maximum Satisfiability Using Cores and Correction Sets.

[BibT_eX]

[DOI]

Nikolaj S. Bjørner

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Equilibria Under the Probabilistic Serial Rule.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Controlling Elections by Replacing Candidates or Votes.

[BibT_eX]

[DOI]

Andrea Loreggia

Francesca Rossi

Kristen Brent Venable

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Manipulating the Probabilistic Serial Rule.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

SAT-Based Strategy Extraction in Reachability Games.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Strategic aspects of the probabilistic serial rule for the allocation of goods.

[BibT_eX]

[DOI]

CoRR, 2014

Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules.

[BibT_eX]

[DOI]

Artif. Intell., 2014

Cores in Core Based MaxSat Algorithms: An Analysis.

[BibT_eX]

[DOI]

Fahiem Bacchus

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Reasoning about Constraint Models.

[BibT_eX]

[DOI]

Proceedings of the PRICAI 2014: Trends in Artificial Intelligence, 2014

The Computational Impact of Partial Votes on Strategic Voting.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

How Hard Is It to Control an Election by Breaking Ties?

[BibT_eX]

[DOI]

Nicholas Mattei

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Solving Games without Controllable Predecessor.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 26th International Conference, 2014

Possible and necessary winner problem in social polls.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

A Game-Theoretic Analysis of Catalog Optimization.

[BibT_eX]

[DOI]

Joel Oren

Craig Boutilier

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Maximum Satisfiability Using Core-Guided MaxSAT Resolution.

[BibT_eX]

[DOI]

Fahiem Bacchus

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Controlling Elections by Replacing Candidates: Theoretical and Experimental Results.

[BibT_eX]

[DOI]

Andrea Loreggia

Francesca Rossi

Kristen Brent Venable

Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

2013

Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Global SPACING Constraint (Technical Report)

[BibT_eX]

[DOI]

Peter Skocovsky

CoRR, 2013

A Social Welfare Optimal Sequential Allocation Procedure.

[BibT_eX]

[DOI]

Thomas Kalinowski

Proceedings of the IJCAI 2013, 2013

On the Complexity of Global Scheduling Constraints under Structural Restrictions.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

Constraint Acquisition via Partial Queries.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

An Adaptive Model Restarts Heuristic.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

Breaking Symmetry with Different Orderings.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2013

Manipulating two stage voting rules.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Coalitional manipulation for Schulze's rule.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Strategic Behavior when Allocating Indivisible Goods Sequentially.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

Ties Matter: Complexity of Manipulation when Tie-Breaking with a Random Vote.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012

Combining Voting Rules Together.

[BibT_eX]

[DOI]

Lirong Xia

Proceedings of the ECAI 2012, 2012

The SeqBin Constraint Revisited.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2012

The RegularGcc Matrix Constraint.

[BibT_eX]

[DOI]

Ronald de Haan

Proceedings of the AI 2012: Advances in Artificial Intelligence, 2012

On the Violation of Circuits in Decomposable Negation Normal Form.

[BibT_eX]

[DOI]

Lucas Bordeaux

Proceedings of the AI 2012: Advances in Artificial Intelligence, 2012

Eliminating the Weakest Link: Making Manipulation Intractable?

[BibT_eX]

[DOI]

Jessica Davies

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Reformulation of global constraints.

[BibT_eX]

[DOI]

PhD thesis, 2011

The Complexity of Integer Bound Propagation.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2011

The weighted Grammar constraint.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2011

The AllDifferent Constraint with Precedences.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011

Manipulation of Nanson's and Baldwin's Rules.

[BibT_eX]

[DOI]

Lirong Xia

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

Complexity of and Algorithms for Borda Manipulation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010

An Empirical Study of Borda Manipulation

[BibT_eX]

[DOI]

CoRR, 2010

On the Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

Decomposition of the NValue Constraint.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

Propagating Conjunctions of AllDifferent Constraints.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Breaking Generator Symmetry

[BibT_eX]

[DOI]

CoRR, 2009

The Weighted CFG Constraint

[BibT_eX]

[DOI]

CoRR, 2009

Circuit Complexity and Decompositions of Global Constraints.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

Decompositions of All Different, Global Cardinality and Related Constraints.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

Reformulating Global Grammar Constraints.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2009

Restricted Global Grammar Constraints.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2009

2008

Combining Symmetry Breaking and Global Constraints.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances in Constraints, 2008

The Weighted CfgConstraint.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

Flow-Based Propagators for the SEQUENCE and Related Global Constraints.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2008

2007

Configuration.

[BibT_eX]

[DOI]

IEEE Intell. Syst., 2007

Constraint and Variable Ordering Heuristics for Compiling Configuration Problems.

[BibT_eX]

[DOI]