1532 search results - page 254 / 307 » The Symbol Grounding Problem |
101
click to vote
DAC
1994
ACM
15 years 4 months ago
1994
ACM
Abstract - We address the problem of automatically verifying large digital designs at the logic level, against high-level specifications. In this paper, we present a methodology wh...
ICLP
1990
Springer
15 years 3 months ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
105
click to vote
ICLP
2010
Springer
15 years 3 months ago
2010
Springer
Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with A...
112
click to vote
FORMATS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We describe a partial order reduction technique for a realtime component model. Components are described as timed automata with data ports, which can be composed in stati...
126
click to vote
ATVA
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Model-checking alternating-time properties has recently attracted much interest in the verification of distributed protocols. While checking the validity of a specificati...