Sciweavers

135 search results - page 23 / 27
» Constructive Logic with Strong Negation as a Substructural L...
Sort
View
COLT
1999
Springer
15 years 1 months ago
On a Generalized Notion of Mistake Bounds
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
Sanjay Jain, Arun Sharma
PERVASIVE
2006
Springer
14 years 9 months ago
Scalability in a Secure Distributed Proof System
Abstract. A logic-based language is often adopted in systems for pervasive computing, because it provides a convenient way to define rules that change the behavior of the systems d...
Kazuhiro Minami, David Kotz
ICLP
2007
Springer
15 years 3 months ago
DLVHEX-SPARQL: A SPARQL Compliant Query Engine Based on DLVHEX
This paper describes the dlvhex SPARQL plugin, a query processor for the upcoming Semantic Web query language standard by W3C. We report on the implementation of this languages usi...
Axel Polleres, Roman Schindlauer
APAL
2006
94views more  APAL 2006»
14 years 9 months ago
Classifiable theories without finitary invariants
: It follows directly from Shelah's structure theory that if T is a classifiable theory, then the isomorphism type of any model of T is determined by the theory of that model ...
Elisabeth Bouscaren, Ehud Hrushovski
81
Voted
ICLP
2005
Springer
15 years 3 months ago
Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
Hans Tompits, Stefan Woltran