Sciweavers

5284 search results - page 696 / 1057
» Ontologizing Semantic Relations
Sort
View
LPNMR
1993
Springer
15 years 11 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
CORR
2010
Springer
157views Education» more  CORR 2010»
15 years 5 months ago
Active Integrity Constraints and Revision Programming
We study active integrity constraints and revision programming, two formalisms designed to describe integrity constraints on databases and to specify policies on preferred ways to...
Luciano Caroprese, Miroslaw Truszczynski
PLDI
2011
ACM
14 years 9 months ago
Safe optimisations for shared-memory concurrent programs
Current proposals for concurrent shared-memory languages, including C++ and C, provide sequential consistency only for programs without data races (the DRF guarantee). While the i...
Jaroslav Sevcík
POPL
2004
ACM
16 years 7 months ago
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
We present a notion of -long ? -normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in norm...
Vincent Balat, Roberto Di Cosmo, Marcelo P. Fiore
WCRE
2008
IEEE
16 years 1 months ago
Automated Concept Location Using Independent Component Analysis
Concept location techniques are designed to help isolate sections of source code that relate to specific concepts. Blind Signal Separation techniques like Singular Value Decompos...
Scott Grant, James R. Cordy, David B. Skillicorn