Sciweavers

571 search results - page 84 / 115
» Domain Theory in Logical Form
Sort
View
DKE
2007
129views more  DKE 2007»
14 years 9 months ago
First-order temporal pattern mining with regular expression constraints
Previous studies on mining sequential patterns have focused on temporal patterns specified by some form of propositional temporal logic. However, there are some interesting seque...
Sandra de Amo, Daniel A. Furtado
JELIA
2010
Springer
14 years 7 months ago
Tabling with Answer Subsumption: Implementation, Applications and Performance
Tabled Logic Programming (TLP) is becoming widely available in Prolog systems, but most implementations of TLP implement only answer variance in which an answer A is added to the t...
Terrance Swift, David Scott Warren
CADE
2012
Springer
13 years 2 days ago
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
François Bobot, Sylvain Conchon, Evelyne Co...
DRM
2007
Springer
15 years 3 months ago
Slicing obfuscations: design, correctness, and evaluation
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
Anirban Majumdar, Stephen Drape, Clark D. Thombors...
AO
2006
127views more  AO 2006»
14 years 9 months ago
Formal ontology meets industry
in ontology is quite abstract and often based on toy-examples to the point that the gap between the work of theoreticians and the needs of real applications is too wide to be cross...
Stefano Borgo, Matteo Cristani, Roberta Cuel