Sciweavers

1137 search results - page 161 / 228
» Knowledge Representation with Logic Programs
Sort
View
AAAI
1997
13 years 9 months ago
Model-Theoretic Semantics and Tractable Algorithm for CNF-BCP
CNF-BCP is a well-known propositional reasoner that extends clausal Boolean Constraint Propagation (BCP) to non-clausal theories. Although BCP has efficient linear-time implementa...
Rahul Roy-Chowdhury, Mukesh Dalal
NGC
2006
Springer
102views Communications» more  NGC 2006»
13 years 7 months ago
Evaluation of Automatic Generation of Basic Stories
Abstract This paper presents an application that automatically generates basic stories: short texts that only narrate the main events of the plot. The system operates with a repres...
Federico Peinado, Pablo Gervás
ENTCS
2008
140views more  ENTCS 2008»
13 years 7 months ago
Higher-Order Separation Logic in Isabelle/HOLCF
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...
Carsten Varming, Lars Birkedal
AAMAS
2000
Springer
13 years 7 months ago
Rational Coordination in Multi-Agent Environments
We adopt the decision-theoretic principle of expected utility maximization as a paradigm for designing autonomous rational agents, and present a framework that uses this paradigm t...
Piotr J. Gmytrasiewicz, Edmund H. Durfee
JELIA
2010
Springer
13 years 6 months ago
Stable Belief Sets Revisited
Stable belief sets were introduced by R. Stalnaker in the early ’80s, as a formal representation of the epistemic state for an ideal introspective agent. This notion motivated M...
Costas D. Koutras, Yorgos Zikos