• Publications
  • Influence
Dsharp: Fast d-DNNF Compilation with sharpSAT
Knowledge compilation is a compelling technique for dealing with the intractability of propositional reasoning. One particularly effective target language is Deterministic Decomposable NegationExpand
  • 84
  • 15
  • Open Access
Improved Non-Deterministic Planning by Exploiting State Relevance
We address the problem of computing a policy for fully observable non-deterministic (FOND) planning problems. By focusing on the relevant aspects of the state of the world, we introduce a series ofExpand
  • 83
  • 7
  • Open Access
Width and Inference Based Planners: SIW, BFS (f), and PROBE
We entered the planners SIW, BFS(f), and PROBE to the agile-track of the 2014 International Planning Competition, and an anytime planner for the satisficing track that runs both SIW and BFS(f). SIWExpand
  • 17
  • 7
  • Open Access
SAT-Based Analysis and Quantification of Information Flow in Programs
Quantitative information flow analysis (QIF) is a portfolio of security techniques quantifying the flow of confidential information to public ports. In this paper, we advance the state of the art inExpand
  • 38
  • 6
  • Open Access
Computing Contingent Plans via Fully Observable Non-Deterministic Planning
Planning with sensing actions under partial observability is a computationally challenging problem that is fundamental to the realization of AI tasks in areas as diverse as robotics, game playing,Expand
  • 44
  • 6
  • Open Access
Planning Over Multi-Agent Epistemic States: A Classical Planning Approach
Many AI applications involve the interaction of multiple autonomous agents, requiring those agents to reason about their own beliefs, as well as those of other agents. However, planning involvingExpand
  • 62
  • 3
  • Open Access
Non-Deterministic Planning with Temporally Extended Goals: LTL over Finite and Infinite Traces
Temporally extended goals are critical to the specification of a diversity of real-world planning problems. Here we examine the problem of non-deterministic planning with temporally extended goalsExpand
  • 42
  • 3
  • Open Access
MAP-LAPKT : Omnipotent Multi-Agent Planning via Compilation to Classical Planning
The general approach is quite simple: we convert the unfactored domain and problem file into a classical planning problem such that the privacy of fluents and objects are respected. The translationExpand
  • 23
  • 3
  • Open Access
#∃SAT: Projected Model Counting
Model counting is the task of computing the number of assignments to variables \(\mathcal{V}\) that satisfy a given propositional theory F. The model counting problem is denoted as #SAT. ModelExpand
  • 18
  • 3
  • Open Access
Finite LTL Synthesis as Planning
LTL synthesis is the task of generating a strategy that satisfies a Linear Temporal Logic (LTL) specification interpreted over infinite traces. In this paper we examine the problem of LTLf synthesis,Expand
  • 20
  • 2
  • Open Access