Sciweavers

265 search results - page 29 / 53
» Inductive Situation Calculus
Sort
View
ECAI
2010
Springer
13 years 8 months ago
On the Verification of Very Expressive Temporal Properties of Non-terminating Golog Programs
Abstract. The agent programming language GOLOG and the underlying Situation Calculus have become popular means for the modelling and control of autonomous agents such as mobile rob...
Jens Claßen, Gerhard Lakemeyer
TCS
2008
13 years 7 months ago
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
Jean-François Dufourd
ECML
2005
Springer
14 years 29 days ago
A Distance-Based Approach for Action Recommendation
Abstract. Rule induction has attracted a great deal of attention in Machine Learning and Data Mining. However, generating rules is not an end in itself because their applicability ...
Ronan Trepos, Ansaf Salleb, Marie-Odile Cordier, V...
DBPL
2003
Springer
120views Database» more  DBPL 2003»
14 years 22 days ago
A Unifying Semantics for Active Databases Using Non-Markovian Theories of Actions
Over the last fifteen years, database management systems (DBMSs) have been enhanced by the addition of rule-based programming to obtain active DBMSs. One of the greatest challeng...
Iluju Kiringa, Raymond Reiter
IJCAI
2001
13 years 9 months ago
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...