Cover Image

Efficiently grounding FOL using bit vectors

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Van Laer, Lucas, Vandevelde, Simon, Vennekens, Joost
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Enhancing Computer Vision with Knowledge: a Rummikub Case Study
by: Vandevelde, Simon, et al.
Published: (2024)

Answer Set Programming for Flexible Payroll Management
by: Callewaert, Benjamin, et al.
Published: (2024)

SCL(FOL) Revisited
by: Bromberger, Martin, et al.
Published: (2023)

Simulating dynamic systems using Linear Time Calculus theories
by: Bogaerts, Bart, et al.
Published: (2014)

Intensional FOL over Belnap's Billatice for Strong-AI Robotics
by: Majkic, Zoran
Published: (2025)

Tree Rewriting Calculi for Strictly Positive Logics
by: Santiago-Fernández, Sofía, et al.
Published: (2025)

The Complexity of the Constructive Master Modality
by: Santiago-Fernández, Sofía, et al.
Published: (2026)

Do LLMs Really Struggle at NL-FOL Translation? Revealing their Strengths via a Novel Benchmarking Strategy
by: Brunello, Andrea, et al.
Published: (2025)

Probabilistic-bit Guided CDCL for SAT Solving using Ising Consensus Assumptions
by: Bino, Melki
Published: (2026)

VERUS-LM: a Versatile Framework for Combining LLMs with Symbolic Reasoning
by: Callewaert, Benjamin, et al.
Published: (2025)

Compositional Reasoning for Probabilistic Automata with Uncertainty
by: Mertens, Hannah, et al.
Published: (2026)

Deciding Equations in the Time Warp Algebra
by: van Gool, Sam, et al.
Published: (2023)

Weighted Rewriting: Semiring Semantics for Abstract Reduction Systems
by: Ahrens, Emma, et al.
Published: (2025)

Efficient Model Checking for the Alternating-Time μ-Calculus via Effectivity Frames
by: Hausmann, Daniel, et al.
Published: (2025)

Formally Verified Animation for RoboChart using Interaction Trees
by: Ye, Kangfeng, et al.
Published: (2023)

A Spectrum of Approximate Probabilistic Bisimulations
by: Spork, Timm, et al.
Published: (2024)

Compositional Reasoning for Parametric Probabilistic Automata
by: Mertens, Hannah, et al.
Published: (2025)

Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains
by: Spork, Timm, et al.
Published: (2025)

PolySAT: Word-level Bit-vector Reasoning in Z3
by: Rath, Jakob, et al.
Published: (2024)

Exact Bayesian Inference for Loopy Probabilistic Programs using Generating Functions
by: Klinkenberg, Lutz, et al.
Published: (2023)

Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains
by: Mertens, Hannah, et al.
Published: (2024)

Coherency through formalisations of Structured Natural Language, A case study on FRETish
by: Joosten, Joost J., et al.
Published: (2026)

SAT Encodings for Bandwidth Coloring: A Systematic Design Study
by: Nguyen, Duc Trung Kim, et al.
Published: (2026)

Network Satisfaction Problems Solved by k-Consistency
by: Bodirsky, Manuel, et al.
Published: (2023)

Towards Concurrent Quantitative Separation Logic
by: Fesefeldt, Ira, et al.
Published: (2022)

Bayesian Inference in Quantum Programs
by: Gehnen, Christina, et al.
Published: (2025)

Quantifier Elimination and Craig Interpolation, Quantitatively
by: Batz, Kevin, et al.
Published: (2025)

Compact SAT Encoding for Power Peak Minimization
by: Van Kieu, Tuyen, et al.
Published: (2025)

Sequent Calculi for Data-Aware Modal Logics
by: Areces, Carlos, et al.
Published: (2025)

SC-TPTP: An Extension of the TPTP Derivation Format for Sequent-Based Calculus
by: Cailler, Julie, et al.
Published: (2025)

Efficient Reactive Synthesis
by: Ye, Xin, et al.
Published: (2024)

Natural Strategic Ability in Stochastic Multi-Agent Systems
by: Berthon, Raphaël, et al.
Published: (2024)

Foundations for Deductive Verification of Continuous Probabilistic Programs: From Lebesgue to Riemann and Back
by: Batz, Kevin, et al.
Published: (2025)

Verification of Robust Multi-Agent Systems
by: Berthon, Raphaël, et al.
Published: (2026)

Verifying Sampling Algorithms via Distributional Invariants
by: Zilken, Daniel, et al.
Published: (2025)

Nominal Type Theory by Nullary Internal Parametricity
by: Van Muylder, Antoine, et al.
Published: (2025)

Verified and Optimized Implementation of Orthologic Proof Search
by: Guilloud, Simon, et al.
Published: (2025)

On Efficient Algorithms For Partial Quantifier Elimination
by: Goldberg, Eugene
Published: (2024)

Efficient Volume Computation for SMT Formulas
by: Shaw, Arijit, et al.
Published: (2025)

Efficient Decision Procedures for RNmatrix Semantics
by: Leme, Renato R., et al.
Published: (2026)