Sciweavers

49 search results - page 6 / 10
» Safe Reasoning with Logic LTS
Sort
View
IJAR
2007
86views more  IJAR 2007»
13 years 7 months ago
Non-deterministic semantics for logics with a consistency operator
In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent...
Arnon Avron
ICLP
2004
Springer
14 years 29 days ago
Speculative Computations in Or-Parallel Tabled Logic Programs
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
ICALP
2007
Springer
14 years 1 months ago
Conservative Ambiguity Detection in Context-Free Grammars
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
Sylvain Schmitz
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 11 months ago
A Foundational View on Integration Problems
The integration of reasoning and computation services across system and language boundaries has been mostly treated from an engineering perspective. In this paper we take a foundat...
Florian Rabe, Michael Kohlhase, Claudio Sacerdoti ...
LOPSTR
2007
Springer
14 years 1 months ago
A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of t...
Mario Méndez-Lojo, Jorge Navas, Manuel V. H...