Sciweavers

1445 search results - page 173 / 289
» Uniformly Hard Languages
Sort
View
ECOOPW
1994
Springer
15 years 8 months ago
Abstracting Interactions Based on Message Sets
ing Interactions Based on Message Sets Svend Frr 1 and Gul Agha2. 1 Hewlett-Packard Laboratories, 1501 Page Mill Road, Palo Alto, CA 94303 2 University of Illinois, 1304 W. Springf...
Svend Frølund, Gul Agha
LPNMR
1993
Springer
15 years 8 months ago
Negation as Partial Failure
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
Bamshad Mobasher, Jacek Leszczylowski, Don Pigozzi
SIGIR
1993
ACM
15 years 8 months ago
A Model of Information Retrieval Based on a Terminological Logic
According to the logical model of Information Retrieval (IR), the task of IR can be described as the extraction, from a given document base, of those documents d that, given a que...
Carlo Meghini, Fabrizio Sebastiani, Umberto Stracc...
CONCUR
2008
Springer
15 years 6 months ago
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
In this paper, we present a unified approach to evaluating the relative expressive power of process calculi. In particular, we identify a small set of criteria (that have already b...
Daniele Gorla
IJCAI
2007
15 years 5 months ago
Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge-Base Combination
In the context of the Semantic Web, several approaches to the combination of ontologies, given in terms of theories of classical first-order logic, and rule bases have been propo...
Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans T...