Sciweavers

1174 search results - page 95 / 235
» A Logical Approach to Abstract Algebra
Sort
View
JAR
2008
95views more  JAR 2008»
13 years 10 months ago
On the Mechanization of the Proof of Hessenberg's Theorem in Coherent Logic
Abstract. We propose to combine interactive proof construction with proof automation for a fragment of first-order logic called Coherent Logic (CL). CL allows enough existential qu...
Marc Bezem, Dimitri Hendriks
CORR
2002
Springer
131views Education» more  CORR 2002»
13 years 10 months ago
Logic Programming with Ordered Disjunction
Abstract. Logic Programming paradigms that allow for expressing preferences have drawn a lot of research interest over the last years. Among them, the principle of ordered disjunct...
Gerhard Brewka
DLOG
2009
13 years 7 months ago
Generalized Closed World Reasoning in Description Logics with Extended Domain Closure
Abstract. Generalized closed world reasoning allows for the assumption of a specified maximal set of negated atomic assertions retaining the consistency of an indefinite knowledge ...
Oliver Gries
SAS
2004
Springer
123views Formal Methods» more  SAS 2004»
14 years 3 months ago
Non-termination Inference for Constraint Logic Programs
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
Étienne Payet, Frédéric Mesna...
JAR
2002
83views more  JAR 2002»
13 years 9 months ago
Mathematical Programming Embeddings of Logic
Abstract. Can theorem proving in mathematical logic be addressed by classical mathematical techniques like the calculus of variations? The answer is surprisingly in the affirmative...
Vivek S. Borkar, Vijay Chandru, Sanjoy K. Mitter