Sciweavers

1142 search results - page 3 / 229
» Approximability of Clausal Constraints
Sort
View
APLAS
2011
ACM
13 years 11 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...
JSAI
2005
Springer
15 years 5 months ago
Representing Information Structure in a Formal Grammar of Danish
This paper presents a proposal for the integration of information structure in a unification-based grammar of Danish. Three information structure features – topic, focus and bac...
Patrizia Paggio
ICLP
2001
Springer
15 years 4 months ago
An Order-Sorted Resolution with Implicitly Negative Sorts
We usually use natural language vocabulary for sort names in order-sorted logics, and some sort names may contradict other sort names in the sort-hierarchy. These implicit negation...
Ken Kaneiwa, Satoshi Tojo
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 3 months ago
Large-Scale Convex Minimization with a Low-Rank Constraint
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
Shai Shalev-Shwartz, Alon Gonen, Ohad Shamir
ILP
2007
Springer
15 years 5 months ago
Applying Inductive Logic Programming to Process Mining
The management of business processes has recently received a lot of attention. One of the most interesting problems is the description of a process model in a language that allows ...
Evelina Lamma, Paola Mello, Fabrizio Riguzzi, Serg...