Sciweavers

686 search results - page 86 / 138
» Nonmonotonic inference operations
Sort
View
IJCAI
1997
13 years 11 months ago
Automation of Diagrammatic Reasoning
Theoremsin automated theorem proving are usually proved by logical formal proofs. However,there is a subset of problems which humanscan prove in a different wayby the use of geome...
Mateja Jamnik, Alan Bundy, Ian Green
AAAI
1996
13 years 11 months ago
Learning Models of Intelligent Agents
Agents that operate in a multi-agent system need an efficient strategy to handle their encounters with other agents involved. Searching for an optimal interactive strategy is a ha...
David Carmel, Shaul Markovitch
LFP
1990
102views more  LFP 1990»
13 years 11 months ago
A Semantic Basis for Quest
Quest is a programming language based on impredicative type quantifiers and subtyping within a three-level structure of kinds, types and type operators, and values. The semantics ...
Luca Cardelli, Giuseppe Longo
SPLC
2007
13 years 11 months ago
Mapping Feature Models onto Component Models to Build Dynamic Software Product Lines
Systems such as adaptative and context–aware ones must adapt themselves to changing requirements at runtime. Modeling and implementing this kind of systems is a difficult opera...
Pablo Trinidad, Antonio Ruiz Cortés, Joaqu&...
GPCE
2008
Springer
13 years 11 months ago
Typing communicating component assemblages
Building complex component-based software architectures can lead to subtle assemblage errors. In this paper, we introduce a typesystem-based approach to avoid message handling err...
Michael Lienhardt, Alan Schmitt, Jean-Bernard Stef...