Sciweavers

3845 search results - page 581 / 769
» Belief Logic Programming
Sort
View
ICLP
1990
Springer
15 years 10 months ago
Extending Definite Clause Grammars with Scoping Constructs
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
Remo Pareschi, Dale Miller
ESWS
2006
Springer
15 years 10 months ago
Rules with Contextually Scoped Negation
Knowledge representation formalisms used on the Semantic Web adhere to a strict open world assumption. Therefore, nonmonotonic reasoning techniques are often viewed with scepticism...
Axel Polleres, Cristina Feier, Andreas Harth
CODES
2008
IEEE
15 years 8 months ago
Model checking SystemC designs using timed automata
SystemC is widely used for modeling and simulation in hardware/software co-design. Due to the lack of a complete formal semantics, it is not possible to verify SystemC designs. In...
Paula Herber, Joachim Fellmuth, Sabine Glesner
AIEDU
2007
108views more  AIEDU 2007»
15 years 6 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...
JLP
2006
81views more  JLP 2006»
15 years 6 months ago
Development graphs - Proof management for structured specifications
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
Till Mossakowski, Serge Autexier, Dieter Hutter