Sciweavers

3552 search results - page 265 / 711
» Proof theory in the abstract
Sort
View
CORR
2008
Springer
106views Education» more  CORR 2008»
15 years 6 months ago
Mapping Semantic Networks to Undirected Networks
Abstract--There exists an injective, information-preserving function that maps a semantic network (i.e a directed labeled network) to a directed network (i.e. a directed unlabeled ...
Marko A. Rodriguez
JAR
2011
112views more  JAR 2011»
15 years 1 months ago
A Framework for Certified Boolean Branch-and-Bound Optimization
We consider optimization problems of the form (S, cost), where S is a clause set over Boolean variables x1 . . . xn, with an arbitrary cost function cost: Bn → R, and the aim is ...
Javier Larrosa, Robert Nieuwenhuis, Albert Olivera...
WWW
2004
ACM
16 years 7 months ago
CTR-S: a logic for specifying contracts in semantic web services
A requirements analysis in the emerging field of Semantic Web Services (SWS) (see http://daml.org/services/swsl/requirements/) has identified four major areas of research: intelli...
Hasan Davulcu, Michael Kifer, I. V. Ramakrishnan
SMI
2005
IEEE
16 years 6 days ago
Maximizing Adaptivity in Hierarchical Topological Models
We present an approach to hierarchically encode the topology of functions over triangulated surfaces. We describe the topology of a function by its Morse-Smale complex, a well kno...
Peer-Timo Bremer, Valerio Pascucci, Bernd Hamann
COMPGEOM
2010
ACM
15 years 11 months ago
Adding one edge to planar graphs makes crossing number hard
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
Sergio Cabello, Bojan Mohar