Sciweavers

1144 search results - page 171 / 229
» Logic programming for combinatorial problems
Sort
View
ICCAD
1995
IEEE
114views Hardware» more  ICCAD 1995»
14 years 16 days ago
Sequential synthesis using S1S
Abstract—We propose the use of the logic S1S as a mathematical framework for studying the synthesis of sequential designs. We will show that this leads to simple and mathematical...
Adnan Aziz, Felice Balarin, Robert K. Brayton, Alb...
ATAL
2008
Springer
13 years 11 months ago
Towards verifying compliance in agent-based web service compositions
We explore the problem of specification and verification of compliance in agent based Web service compositions. We use the formalism of temporal-epistemic logic suitably extended ...
Alessio Lomuscio, Hongyang Qu, Monika Solanki
CADE
2010
Springer
13 years 10 months ago
MCMT: A Model Checker Modulo Theories
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
Silvio Ghilardi, Silvio Ranise
TCS
2008
13 years 8 months ago
Verification of qualitative Z constraints
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
Stéphane Demri, Régis Gascon
FOIKS
2006
Springer
14 years 19 days ago
Reasoning Support for Expressive Ontology Languages Using a Theorem Prover
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
Ian Horrocks, Andrei Voronkov