Sciweavers

130 search results - page 6 / 26
» The road to two theorems of logic
Sort
View
JAIR
2007
108views more  JAIR 2007»
14 years 9 months ago
Discovering Classes of Strongly Equivalent Logic Programs
We report on a successful experiment of computeraided theorem discovery in the area of logic programming with answer set semantics. Specifically, with the help of computers, we d...
Fangzhen Lin, Yin Chen
LFCS
2007
Springer
15 years 4 months ago
Realizations and LP
LP can be seen as a logic of knowledge with justifications. Artemov’s Realization Theorem says justifications can be extracted from validities in the more conventional Hintikk...
Melvin Fitting
LPNMR
2005
Springer
15 years 3 months ago
On Modular Translations and Strong Equivalence
Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main the...
Paolo Ferraris
AMAI
2000
Springer
14 years 9 months ago
A prospective on mathematics and artificial intelligence: Problem solving=Modeling+Theorem proving
This is a prospective on the research in the intersection of mathematics and artificial intelligence that I see as having been the most important over the past 10 years and that I...
Harvey J. Greenberg
AIML
2004
14 years 11 months ago
Complexity of Strict Implication
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
Félix Bou