Sciweavers

590 search results - page 49 / 118
» From Relational Specifications to Logic Programs
Sort
View
CORR
1999
Springer
95views Education» more  CORR 1999»
13 years 8 months ago
Fixed-parameter tractability, definability, and model checking
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
Jörg Flum, Martin Grohe
ICML
2004
IEEE
14 years 9 months ago
Learning first-order rules from data with multiple parts: applications on mining chemical compound data
Inductive learning of first-order theory based on examples has serious bottleneck in the enormous hypothesis search space needed, making existing learning approaches perform poorl...
Cholwich Nattee, Sukree Sinthupinyo, Masayuki Numa...
FOSSACS
2006
Springer
14 years 14 days ago
A Logic of Reachable Patterns in Linked Data-Structures
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...
Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sag...
FBIT
2007
IEEE
14 years 3 months ago
Rough Set Based Information Retrieval from Argumentative Data Points in Weblogs
This paper describes a decision tree model and 3dimensional representation of information retrieved from various weblogs in relation to argumentative logics. The weblogs are consi...
Sea Woo Kim, Chin-Wan Chung
VMCAI
2010
Springer
14 years 6 months ago
Building a Calculus of Data Structures
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
Viktor Kuncak, Ruzica Piskac, Philippe Suter, Thom...