175 search results - page 7 / 35 » The Complexity of Model Checking Higher-Order Fixpoint Logic |
CSREAESA
2004
14 years 11 months ago
2004
- The model of a simple perceptron using phase-encoded inputs and complex-valued weights is presented. Multilayer two-input and three-input complex-valued neurons (CVNs) are implem...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We study the model checking problem, for fixed structures A, over positive equality-free first-order logic
ICLP
1997
Springer
15 years 1 months ago
1997
Springer
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
LOGCOM
2002
14 years 9 months ago
2002
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
ASE
2004
14 years 9 months ago
2004
In this paper, we develop model checking procedures for three ways of combining (temporal) logics: temporalization, independent combination, and join. We prove that they are termin...