210 search results - page 24 / 42 » A Formal Theory of Key Conjuring |
AAAI
2004
13 years 8 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
EUMAS
2006
13 years 8 months ago
2006
Ontology matching is currently a key technology to achieve the semantic alignment of ontological entities used by knowledge-based applications, and therefore to enable their inter...
DLT
2003
13 years 8 months ago
2003
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
WSC
1996
13 years 8 months ago
1996
The author is revising and restructuring an existing simulation course designed primarily for senior computer science majors by: 1) developing an integrated set of laboratory exer...
AI
2007
Springer
13 years 7 months ago
2007
Springer
The increasing variety of semantics proposed in the context of Dung’s theory of argumentation makes more and more inadequate the example-based approach commonly adopted for eval...