Predicting and detecting symmetries in FOL finite model search
From MaRDI portal
Publication:861703
DOI10.1007/s10817-006-9040-3zbMath1107.68092MaRDI QIDQ861703
Belaïd Benhamou, Gilles Audemard, Laurent Henocque
Publication date: 30 January 2007
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-006-9040-3
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The TPTP problem library. CNF release v1. 2. 1
- Tractability through symmetries in propositional calculus
- Constructing finite algebras with FALCON
- Networks of constraints: Fundamental properties and applications to picture processing
- Automatic Detection of Variable and Value Symmetries
- A new method for automated finite model building exploiting failures and symmetries
- Decision procedures and model building in equational clause logic