Sciweavers

29 search results - page 3 / 6
» A Finite Basis for Failure Semantics
Sort
View
COGSCI
2004
92views more  COGSCI 2004»
13 years 6 months ago
Varieties of crossing dependencies: structure dependence and mild context sensitivity
Four different kinds of grammars that can define crossing dependencies in human language are compared here: (i) context sensitive rewrite grammars with rules that depend on contex...
Edward P. Stabler Jr.
AI
2008
Springer
13 years 4 months ago
MEBN: A language for first-order Bayesian knowledge bases
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...
Kathryn B. Laskey
ICLP
1994
Springer
13 years 10 months ago
Compiling Intensional Sets in CLP
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...
Paola Bruscoli, Agostino Dovier, Enrico Pontelli, ...
DEDS
2002
119views more  DEDS 2002»
13 years 6 months ago
Diagnosing Discrete-Event Systems: Extending the "Diagnoser Approach" to Deal with Telecommunication Networks
Abstract. Detection and isolation of failures in large and complex systems such as telecommunication networks are crucial and challenging tasks. The problem considered here is that...
Laurence Rozé, Marie-Odile Cordier
CADE
2004
Springer
14 years 6 months ago
Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
José Meseguer, Grigore Rosu