Sciweavers

654 search results - page 39 / 131
» Ordered Sets and Complete Lattices
Sort
View
VL
2007
IEEE
104views Visual Languages» more  VL 2007»
14 years 1 months ago
A Peirce Style Calculus for ALC
Description logics (DLs) are a well-understood family of knowledge representation (KR) languages. The notation of DLs has the flavour of a variable-free first order predicate lo...
Frithjof Dau, Peter W. Eklund
JUCS
2010
114views more  JUCS 2010»
13 years 6 months ago
An Axiomatization of a First-order Branching Time Temporal Logic
: We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no fini...
Dragan Doder, Zoran Ognjanovic, Zoran Markovic
AI
2006
Springer
13 years 9 months ago
A Smart Home Agent for Plan Recognition
Assistance to people suffering from cognitive deficiencies in a smart home raises complex issues. Plan recognition is one of them. We propose a formal framework for the recognition...
Bruno Bouchard, Sylvain Giroux, Abdenour Bouzouane
CORR
2011
Springer
180views Education» more  CORR 2011»
13 years 2 months ago
Commutative Algebra of Statistical Ranking
A model for statistical ranking is a family of probability distributions whose states are orderings of a xed nite set of items. We represent the orderings as maximal chains in a ...
Bernd Sturmfels, Volkmar Welker
IJCAI
2007
13 years 9 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...