Sciweavers

116 search results - page 6 / 24
» Reasoning Symbolically About Partially Matched Cases
Sort
View
75
Voted
ICMLA
2007
14 years 11 months ago
Learning to evaluate conditional partial plans
In our research we study rational agents which learn how to choose the best conditional, partial plan in any situation. The agent uses an incomplete symbolic inference engine, emp...
Slawomir Nowaczyk, Jacek Malec
MKWI
2008
190views Business» more  MKWI 2008»
14 years 11 months ago
Partial Matchmaking for complex Product and Service Descriptions
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
Heiner Stuckenschmidt, Martin Kolb
DIAGRAMS
2008
Springer
14 years 11 months ago
Diagrammatic Logic of Existential Graphs: A Case Study of Commands
Diagrammatic logics have advantages over symbolic cousins. Peirce thought that logical diagrams (Existential Graphs, EG) are capable of "expression of all assertions", as...
Ahti-Veikko Pietarinen
IANDC
2008
141views more  IANDC 2008»
14 years 9 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
JAR
2010
122views more  JAR 2010»
14 years 4 months ago
Partial and Nested Recursive Function Definitions in Higher-order Logic
Based on inductive definitions, we develop a tool that automates the definition of partial recursive functions in higher-order logic (HOL) and provides appropriate proof rules for ...
Alexander Krauss