Sciweavers

402 search results - page 49 / 81
» Model Checking Quantified Computation Tree Logic
Sort
View
BMCBI
2011
13 years 6 months ago
A discriminative method for family-based protein remote homology detection that combines inductive logic programming and proposi
Background: Remote homology detection is a hard computational problem. Most approaches have trained computational models by using either full protein sequences or multiple sequenc...
Juliana S. Bernardes, Alessandra Carbone, Gerson Z...
STACS
1999
Springer
14 years 3 months ago
The Weakness of Self-Complementation
Model checking is a method for the verification of systems with respect to their specifications. Symbolic model-checking, which enables the verification of large systems, procee...
Orna Kupferman, Moshe Y. Vardi
ATAL
2010
Springer
14 years 3 days ago
Alternating-time dynamic logic
We propose Alternating-time Dynamic Logic (ADL) as a multi-agent variant of Dynamic Logic in which atomic programs are replaced by coalitions. In ADL, the Dynamic Logic operators ...
Nicolas Troquard, Dirk Walther
ENTCS
2007
158views more  ENTCS 2007»
13 years 11 months ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer
SLP
1993
110views more  SLP 1993»
14 years 9 days ago
Logic Program Specialisation With Deletion of Useless Clauses
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
D. Andre de Waal, John P. Gallagher