Sciweavers

3047 search results - page 68 / 610
» On the Meaning of Logical Completeness
Sort
View
111
Voted
ESA
2005
Springer
162views Algorithms» more  ESA 2005»
15 years 6 months ago
Minimal Interval Completions
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve...
131
Voted
JMIV
1998
93views more  JMIV 1998»
15 years 9 days ago
Connectivity on Complete Lattices
Classically, connectivity is a topological notion for sets, often introduced by means of arcs. A non topological axiomatics has been proposed by Matheron and Serra. The present pa...
Jean Serra
76
Voted
ISJ
1998
82views more  ISJ 1998»
15 years 9 days ago
Successfully completing case study research: combining rigour, relevance and pragmatism
The organizational and social issues associated with the development, implementation and use of computer-based information systems have increasingly attracted the attention of info...
Peta Darke, Graeme G. Shanks, Marianne Broadbent
102
Voted
CADE
2008
Springer
16 years 29 days ago
Towards Fully Automated Axiom Extraction for Finite-Valued Logics
Abstract. We implement an algorithm for extracting appropriate collections of classic-like sound and complete tableaux rules for a large class of finite-valued logics. Its output c...
Dalmo Mendonca, João Marcos
89
Voted
CSR
2006
Springer
15 years 4 months ago
Logic of Proofs for Bounded Arithmetic
The logic of proofs is known to be complete for the semantics of proofs in PA. In this paper we present a refinement of this theorem, we will show that we can assure that all the ...
Evan Goris