Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleNovember 2016
Explanatory Relations Revisited: Links with Credibility-Limited Revision
Advances in Artificial Intelligence - IBERAMIA 2016Pages 25–36https://doi.org/10.1007/978-3-319-47955-2_3AbstractWe study binary relations over propositional formulas built over a finite set of variables. The meaning of is that is a preferred explanation of the observation . These relations are called Explanatory or abductive relations. We find two important ...
- ArticleMarch 2023
Model Checking with SAT-Based Characterization of ACTL Formulas
AbstractBounded semantics of LTL with existential interpretation and that of ECTL (the existential fragment of CTL), and the characterization of these existentially interpreted properties have been studied and used as the theoretical basis for SAT-based ...
- ArticleMarch 2023
Integrating Inductive Definitions in SAT
Logic for Programming, Artificial Intelligence, and ReasoningPages 378–392https://doi.org/10.1007/978-3-540-75560-9_28AbstractWe investigate techniques for supporting inductive definitions (IDs) in SAT, and report on an implementation, called MidL, of the resulting solver. This solver was first introduced in [11], as a part of a declarative problem solving framework. We ...
- research-articleMay 1996
Short resolution proofs for a sequence of tricky formulas
AbstractA class of propositional formulas, encoding the property that every finite, transitive digraph with no two-cycles must have a source, has been investigated by Krishnamurty and conjectured as hard for resolution. In this note we prove, opposed to ...