Sciweavers

2722 search results - page 328 / 545
» Automating Language Evolution
Sort
View
ICLP
2009
Springer
16 years 4 months ago
Answer Set Programming with Constraints Using Lazy Grounding
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
Agostino Dovier, Alessandro Dal Palù, Enric...
POPL
2005
ACM
16 years 4 months ago
Inferring authentication tags
We present PEAR (Protocol Extendable AnalyzeR), a tool automating the two static analyses for authentication protocols presented in [7, 8]. These analyses are based on a tagging s...
Riccardo Focardi, Matteo Maffei, Francesco Placell...
CADE
2008
Springer
16 years 4 months ago
Celf - A Logical Framework for Deductive and Concurrent Systems (System Description)
CLF (Concurrent LF) [CPWW02a] is a logical framework for specifying and implementing deductive and concurrent systems from areas, such as programming language theory, security prot...
Anders Schack-Nielsen, Carsten Schürmann
EDBT
2002
ACM
112views Database» more  EDBT 2002»
16 years 4 months ago
Querying with Intrinsic Preferences
The handling of user preferences is becoming an increasingly important issue in present-day information systems. Among others, preferences are used for information filtering and ex...
Jan Chomicki
TIME
2009
IEEE
15 years 10 months ago
Event-Oriented Data Models and Temporal Queries in Transaction-Time Databases
—Past research on temporal databases has primarily focused on state-based representations and on relational query language extensions for such representations. This led to many d...
Carlo Zaniolo