Sciweavers

4513 search results - page 102 / 903
» Logic programming with satisfiability
Sort
View
EXACT
2007
15 years 5 months ago
Learning Models from Temporal-Logic Properties via Explanations
Given a model and a property expressed in temporal logic, a model checker normally produces a counterexample in case the model does not satisfy the property. This counterexample i...
Miguel A. Carrillo, David A. Rosenblueth
DLOG
2010
15 years 1 months ago
Decidability of Description Logics with Transitive Closure of Roles in Concept and Role Inclusion Axioms
Abstract. This paper investigates Description Logics which allow transitive closure of roles to occur not only in concept inclusion axioms but also in role inclusion axioms. First,...
Chan Le Duc, Myriam Lamolle
ICCAD
2010
IEEE
140views Hardware» more  ICCAD 2010»
15 years 1 months ago
Reduction of interpolants for logic synthesis
Craig Interpolation is a state-of-the-art technique for logic synthesis and verification, based on Boolean Satisfiability (SAT). Leveraging the efficacy of SAT algorithms, Craig In...
John D. Backes, Marc D. Riedel
NMR
2004
Springer
15 years 8 months ago
Generalizing the AGM postulates: preliminary results and applications
One of the crucial actions any reasoning system must undertake is the updating of its Knowledge Base (KB). This problem is usually referred to as the problem of belief change. The...
Giorgos Flouris, Dimitris Plexousakis, Grigoris An...
TABLEAUX
1998
Springer
15 years 7 months ago
Fibring Semantic Tableaux
The methodology of fibring is a successful framework for combining logical systems based on combining their semantics. In this paper, we extend the fibring approach to calculi for ...
Bernhard Beckert, Dov M. Gabbay