Sciweavers

7456 search results - page 1082 / 1492
» Parallelism in Logic Programming
Sort
View
IFIP
2004
Springer
16 years 5 days ago
The Simply-typed Pure Pattern Type System Ensures Strong Normalization
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
Benjamin Wack
ICDM
2003
IEEE
136views Data Mining» more  ICDM 2003»
16 years 3 days ago
Statistical Relational Learning for Document Mining
A major obstacle to fully integrated deployment of many data mining algorithms is the assumption that data sits in a single table, even though most real-world databases have compl...
Alexandrin Popescul, Lyle H. Ungar, Steve Lawrence...
ICLP
1997
Springer
15 years 11 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
ER
1994
Springer
121views Database» more  ER 1994»
15 years 11 months ago
An Executable Meta Model for Re-Engineering of Database Schemas
A logical database schema, e.g. a relational one, is an implementation of a speci cation, e.g. an entity-relationship diagram. Upcoming new data models and the necessity of seamle...
Manfred A. Jeusfeld, Uwe A. Johnen
ICTL
1994
15 years 11 months ago
Abduction in Temporal Reasoning
Commonsense knowledge often omits the temporal incidence of facts, and even the ordering between occurrences is only available for some of their instances. Reasoning about the temp...
Cristina Ribeiro, António Porto
« Prev « First page 1082 / 1492 Last » Next »