Sciweavers

111 search results - page 14 / 23
» Definability in Logic and Rough Set Theory
Sort
View
CSL
2006
Springer
13 years 11 months ago
Game Quantification on Automatic Structures and Hierarchical Model Checking Games
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
Lukasz Kaiser
AIEDU
2007
108views more  AIEDU 2007»
13 years 7 months ago
Explicit Reflection in Prolog-Tutor
This paper describes a reflection-based approach for open learner modeling (OLM). Tutoring dialogues are used by learners to explicitly reveal their own knowledge state to themselv...
Joséphine M. P. Tchétagni, Roger Nka...
CSL
2007
Springer
13 years 11 months ago
MSO on the Infinite Binary Tree: Choice and Order
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
Arnaud Carayol, Christof Löding
DEON
2006
Springer
13 years 11 months ago
Strategic Deontic Temporal Logic as a Reduction to ATL, with an Application to Chisholm's Scenario
In this paper we extend earlier work on deontic deadlines in CTL to the framework of alternating time temporal logic (ATL). The resulting setting enables us to model several concep...
Jan Broersen
IS
2006
13 years 7 months ago
Composition of Semantic Web services using Linear Logic theorem proving
This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses a Semantic Web service language (DAML-S)...
Jinghai Rao, Peep Küngas, Mihhail Matskin