ACL
1990
14 years 10 months ago
1990
A compositional semantics for focusing subjuncts-words such as only, even, and also--is developed from Rooth's theory of association with focus. By adapting the theory so tha...
AAAI
1990
14 years 10 months ago
1990
Cyclic definitions are often prohibited in terminological knowledge representation languages because, from a theoretical point of view, their semantics is not clear and, from a pr...
AAAI
1993
14 years 10 months ago
1993
In planning tasks an agent may often find himself in a situation demanding that he choose an action that would prevent some unwanted event from occurring. Similarly, in tasks invo...
ICMAS
1998
14 years 10 months ago
1998
This paper examines the issue of developing semantics for agent communication languages. In particular, it considers the problem of giving a verifiable semantics for such language...
FMOODS
2000
14 years 10 months ago
2000
We propose a formal real-time semantics for UML statecharts aimed at the requirements level. A requirements-level model assumes perfect technology and has a considerably simpler se...
DLOG
2000
14 years 10 months ago
2000
Recently, there has been a wide interest in using ontologies on the Web. As a basis for this, RDF Schema (RDFS) provides means to define vocabulary, structure and constraints for ...
109
click to vote
VIP
2003
14 years 10 months ago
2003
To bridge the semantic gap in content-based image retrieval, detecting meaningful visual entities (e.g. faces, sky, foliage, buildings etc) in image content and classifying images...
AAAI
2000
14 years 10 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
AAAI
1998
14 years 10 months ago
1998
The paper presents a constructive 3-valued semantics for autoepistemic logic (AEL). We introduce a derivation operator and de ne the semantics as its least xpoint. The semantics is...
AAAI
1998
14 years 10 months ago
1998
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...