Sciweavers

268 search results - page 21 / 54
» Expressive Power of Grammatical Formalisms
Sort
View
KRDB
2003
117views Database» more  KRDB 2003»
15 years 7 months ago
On a Unifying Framework for Comparing Knowledge Representation Schemes
Given the numerous knowledge representation models (KR-schemes) that have been proposed, it would be desirable to have a formal, unifying model for the description of a KR-scheme,...
Giorgos Flouris, Dimitris Plexousakis, Grigoris An...
157
Voted
AAAI
2004
15 years 7 months ago
Extending CP-Nets with Stronger Conditional Preference Statements
A logic of conditional preferences is defined, with a language which allows the compact representation of certain kinds of conditional preference statements, a semantics and a pro...
Nic Wilson
159
Voted
CONCUR
2004
Springer
15 years 11 months ago
Characterizing EF and EX Tree Logics
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
Mikolaj Bojanczyk, Igor Walukiewicz
ENTCS
2010
75views more  ENTCS 2010»
15 years 5 months ago
A Lightweight Approach to Customizable Composition Operators for Java-like Classes
We propose a formal framework for extending a class-based language, equipped with a given class composition mechanism, to allow programmers to define their own derived composition...
Giovanni Lagorio, Marco Servetto, Elena Zucca
SEMWEB
2004
Springer
15 years 11 months ago
Small Can Be Beautiful in the Semantic Web
In 1984, Peter Patel-Schneider published a paper [1] entitled Small can be Beautiful in Knowledge Representation in which he advocated for limiting the expressive power of knowledg...
Marie-Christine Rousset