Search Results for author:
Found 10 papers, 3 papers with code
Canonical Decision Diagrams Modulo Theories
In this paper, we present a novel very-general technique to leverage DDs to SMT level, which has several advantages: it is very easy to implement on top of an AllSMT solver and a DD package, which are used as blackboxes; it works for every form of DDs and every theory, or combination thereof, supported by the AllSMT solver; it produces theory-canonical T-DDs if the propositional DD is canonical.
A Unified Framework for Probabilistic Verification of AI Systems via Weighted Model Integration
The probabilistic formal verification (PFV) of AI systems is in its infancy.
Enhancing SMT-based Weighted Model Integration by Structure Awareness
The development of efficient exact and approximate algorithms for probabilistic inference is a long-standing goal of artificial intelligence research.
SMT-based Weighted Model Integration with Structure Awareness
Weighted Model Integration (WMI) is a popular formalism aimed at unifying approaches for probabilistic inference in hybrid domains, involving logical and algebraic constraints.
Are You Satisfied by This Partial Assignment?
Many procedures for SAT and SAT-related problems -- in particular for those requiring the complete enumeration of satisfying truth assignments -- rely their efficiency on the detection of partial assignments satisfying an input formula.
Multi-Object Reasoning with Constrained Goal Models
Goal models have been widely used in Computer Science to represent software requirements, business objectives, and design qualities.
Structured Learning Modulo Theories
The main idea is to leverage a state-of-the-art generalized Satisfiability Modulo Theory solver for implementing the inference and separation oracles of Structured Output SVMs.
Hybrid SRL with Optimization Modulo Theories
Generally speaking, the goal of constructive learning could be seen as, given an example set of structured objects, to generate novel objects with similar properties.
Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories
In this paper we present a novel approach to this problem, called the Lemma-Lifting approach.
Automated Reasoning in Modal and Description Logics via SAT Encoding: the Case Study of K(m)/ALC-Satisfiability
In this paper we start exploring the idea of performing automated reasoning tasks in modal and description logics by encoding them into SAT, so that to be handled by state-of-the-art SAT tools; as with most previous approaches, we begin our investigation from the satisfiability in K(m).
