Sciweavers

4266 search results - page 100 / 854
» A Framework for Defining Logics
Sort
View
ENTCS
2010
119views more  ENTCS 2010»
14 years 10 months ago
A Tableau Method for Checking Rule Admissibility in S4
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the mod...
Sergey Babenyshev, Vladimir V. Rybakov, Renate A. ...
AMAI
2006
Springer
14 years 10 months ago
Strong order equivalence
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively and were shown to be beneficial for modular programming and automated optimizati...
Wolfgang Faber, Kathrin Konczak
MLG
2007
Springer
15 years 4 months ago
Comparative Evaluation of PL languages
We introduce a framework for an empirical evaluation of probabilistic logic languages and systems.
Manfred Jaeger, Petr Lidman, Juan L. Mateo
CADE
2004
Springer
15 years 10 months ago
Formalizing Undefinedness Arising in Calculus
Abstract. Undefined terms are commonplace in mathematics, particularly in calculus. The traditional approach to undefinedness in mathematical practice is to treat undefined terms a...
William M. Farmer
AGP
1994
IEEE
15 years 1 months ago
A Compositional Semantics for Conditional Term Rewriting Systems
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
María Alpuente, Moreno Falaschi, Marí...