The Challenge of Unifying Semantic and Syntactic Inference Restrictions

Christoph Weidenbach (1, 2)

1 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
2 MPII - Max-Planck-Institut für Informatik

While syntactic inference restrictions don't play an important role for SAT, they are an essential reasoning technique for more expressive logics, such as first-order logic, or fragments thereof. In particular, they can result in short proofs or model representations. On the other hand, semantically guided inference systems enjoy important properties, such as the generation of solely non-redundant clauses. I discuss to what extend the two paradigms may be unifiable.

Domaines: Logique en informatique [cs.LO]

Christoph Weidenbach. The Challenge of Unifying Semantic and Syntactic Inference Restrictions. 2nd International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements (ARCADE 2019), 2019, Natal, Brazil. ⟨hal-02406673⟩