Sciweavers

64 search results - page 11 / 13
» Normal Forms for Inductive Logic Programming
Sort
View
ENTCS
2008
102views more  ENTCS 2008»
13 years 5 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
DLT
2006
13 years 7 months ago
Well-Founded Semantics for Boolean Grammars
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
Vassilis Kountouriotis, Christos Nomikos, Panos Ro...
LPKR
1997
Springer
13 years 10 months ago
Generalizing Updates: From Models to Programs
Abstract. Recently the field of theory update has seen some improvement, in what concerns model updating, by allowing updates to be specified by so-called revision programs. The ...
João Alexandre Leite, Luís Moniz Per...
CIA
2006
Springer
13 years 9 months ago
Market-Inspired Approach to Collaborative Learning
The paper describes a decentralized peer-to-peer multi-agent learning method based on inductive logic programming and knowledge trading. The method uses first-order logic for model...
Jan Tozicka, Michal Jakob, Michal Pechoucek
CADE
2004
Springer
14 years 6 months ago
Model Checking Using Tabled Rewriting
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
Zhiyao Liang