Sciweavers

550 search results - page 32 / 110
» Context Semantics, Linear Logic and Computational Complexity
Sort
View
LOGCOM
2000
63views more  LOGCOM 2000»
14 years 9 months ago
Reflection principles in computational logic
We introduce the concept of reflection principle as a knowledge representation paradigm in a computational logic setting. Reflection principles are expressed as certain kinds of l...
Jonas Barklund, Pierangelo Dell'Acqua, Stefania Co...
LPNMR
2007
Springer
15 years 3 months ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...
COCO
2003
Springer
114views Algorithms» more  COCO 2003»
15 years 2 months ago
Bounded Nondeterminism and Alternation in Parameterized Complexity Theory
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
Yijia Chen, Jörg Flum, Martin Grohe
COLING
2002
14 years 9 months ago
The Chinese Aspect System and its Semantic Interpretation
: Motivated by a systematic representation of the Chinese aspect forms that explores their intrinsic semantics and temporal logical relations, we are constructing a Chinese aspect ...
Guowen Yang, John A. Bateman
GRC
2005
IEEE
15 years 3 months ago
Temporal granular logic for temporal data mining
— In this article, a formalism for a specific temporal data mining task (the discovery of rules, inferred from databases of events having a temporal dimension), is defined. The...
Paul Cotofrei, Kilian Stoffel