Sciweavers

111 search results - page 14 / 23
» Using Counterfactuals in Knowledge-Based Programming
Sort
View
ATAL
2006
Springer
13 years 11 months ago
Verifying space and time requirements for resource-bounded agents
The effective reasoning capability of an agent can be defined as its capability to infer, within a given space and time bound, facts that are logical consequences of its knowledge...
Natasha Alechina, Mark Jago, Piergiorgio Bertoli, ...
ECAI
1992
Springer
13 years 11 months ago
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
Ilkka Niemelä, Jussi Rintanen
FOSSACS
2007
Springer
14 years 1 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
ATAL
2007
Springer
13 years 11 months ago
Negotiation by abduction and relaxation
This paper studies a logical framework for automated negotiation between two agents. We suppose an agent who has a knowledge base represented by a logic program. Then, we introduc...
Chiaki Sakama, Katsumi Inoue
ANLP
1992
126views more  ANLP 1992»
13 years 8 months ago
Overview of Natural Language Processing of Captions for Retrieving Multimedia Data
This paper briefly describes the current implementation status of an intelligent information retrieval system, MARIE, that employs natural language processing techniques. Descript...
Eugene J. Guglielmo, Neil C. Rowe