Concept
First-order logic
Related publications (103)
Efficient Continual Finite-Sum Minimization
Volkan Cevher, Efstratios Panteleimon Skoulakis, Leello Tadesse Dadi
Given a sequence of functions with , finite-sum minimization seeks a point minimizing . In this work, we propose a key twist into the finite-sum minimizat ...
2024Scalable Logic Rewriting Using Don’t Cares
Giovanni De Micheli, Alessandro Tempia Calvino
Logic rewriting is a powerful optimization technique that replaces small sections of a Boolean network with better implementations. Typically, exact synthesis is used to compute optimum replacement on-the-fly, with possible support for Boolean don't cares. ...
2024A Reduced Order Model for Domain Decompositions with Non-conforming Interfaces
Alfio Quarteroni, Andrea Manzoni
In this paper, we propose a reduced-order modeling strategy for two-way Dirichlet-Neumann parametric coupled problems solved with domain-decomposition (DD) sub-structuring methods. We split the original coupled differential problem into two sub-problems wi ...
New York2024Interpolation and Quantifiers in Ortholattices
Viktor Kuncak, Simon Guilloud, Sankalp Gambhir
We study quantifiers and interpolation properties in ortho- logic, a non-distributive weakening of classical logic that is sound for formula validity with respect to classical logic, yet has a quadratic-time decision procedure. We present a sequent-based p ...
2024Interpolation and Quantifiers in Ortholattices
Viktor Kuncak, Simon Guilloud, Sankalp Gambhir
We study quantifiers and interpolation properties in orthologic, a non-distributive weakening of classical logic that is sound for formula validity with respect to classical logic, yet has a quadratic-time decision procedure. We present a sequent-based pro ...
Cham2024Decision Procedures for Power Structures
We study the decision problem for the existential fragment of the theory of power structures. We prove complexity results that parallel the decidability results of Feferman-Vaught for the theories of product structures thereby showing that the construction ...
EPFL2023The Complexity of Checking Non-Emptiness in Symbolic Tree Automata
We study the satisfiability problem of symbolic tree automata and decompose it into the satisfiability problem of the existential first-order theory of the input characters and the existential monadic second-order theory of the indices of the accepted word ...
2023LISA – A Modern Proof System
Viktor Kuncak, Simon Guilloud, Sankalp Gambhir
We present LISA, a proof system and proof assistant for constructing proofs in schematic first-order logic and axiomatic set theory. The logical kernel of the system is a proof checker for first-order logic with equality and schematic predicate and fun ...
2023Energy Efficient Logic and Memory Design With Beyond-CMOS Magnetoelectric Spin-Orbit (MESO) Technology Toward Ultralow Supply Voltage
Devices based on the spin as the fundamental computing unit provide a promising beyond-complementary metal-oxide-semiconductor (CMOS) device option, thanks to their energy efficiency and compatibility with CMOS. One such option is a magnetoelectric spin-or ...
Piscataway2023Validating functional redundancy with mixed generative adversarial networks
Thanh Trung Huynh, Quoc Viet Hung Nguyen, Thành Tâm Nguyên, Trung-Dung Hoang
Data redundancy has been one of the most important problems in data-intensive applications such as data mining and machine learning. Removing data redundancy brings many benefits in efficient data updating, effective data storage, and error-free query proc ...
ELSEVIER2023