satisfiability problem

Quiet Planting for k-SAT, Multiple Solutions of Arbitrary Geometry COLT 2026 From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy ICLR 2025 Large Language Models Can Solve Real-World Planning Rigorously with Formal Verification Tools NAACL 2025 SATBench: Benchmarking LLMs’ Logical Reasoning via Automated Puzzle Generation from SAT Formulas EMNLP 2025 Structure based SAT dataset for analysing GNN generalisation AISTATS 2025 Transformer Encoder Satisfiability: Complexity and Impact on Formal Reasoning ICLR 2025 A Logic for Reasoning about Aggregate-Combine Graph Neural Networks IJCAI 2024 Data Complexity in Expressive Description Logics with Path Expressions IJCAI 2024 Natural Language Satisfiability: Exploring the Problem Distribution and Evaluating Transformer-based Language Models ACL 2024 The Hardness of Reasoning about Probabilities and Causality IJCAI 2023 Can Transformers Reason in Fragments of Natural Language? EMNLP 2022 NSNet: A General Neural Probabilistic Framework for Satisfiability Problems NeurIPS 2022 A Logic of Directions IJCAI 2020 Model-Agnostic Counterfactual Explanations for Consequential Decisions AISTATS 2020 Decidability of Model Checking Multi-Agent Systems with Regular Expressions against Epistemic HS Specifications IJCAI 2019 Detection of Planted Solutions for Flat Satisfiability Problems AISTATS 2019 G2SAT: Learning to Generate SAT Formulas NeurIPS 2019 Combining DL-Lite_{bool}^N with Branching Time: A gentle Marriage IJCAI 2017 The Ceteris Paribus Structure of Logics of Game Forms (Extended Abstract) IJCAI 2017 Action-Model Based Multi-agent Plan Recognition NeurIPS 2012