Sciweavers

17054 search results - page 150 / 3411
» Logics of Dynamical Systems
Sort
View
CADE
2008
Springer
15 years 9 months ago
Canonical Inference for Implicational Systems
Completion is a general paradigm for applying inferences to generate a canonical presentation of a logical theory, or to semi-decide the validity of theorems, or to answer queries....
Maria Paola Bonacina, Nachum Dershowitz
ISSAC
1990
Springer
83views Mathematics» more  ISSAC 1990»
15 years 11 months ago
Resolution Proof Systems with Weak Transformation Rules
In the previous papers [7-101we defined and explored a formal methodological framework on the basis of which resolution proof systems for strongly-finite logics can be introduced ...
Zbigniew Stachniak
DEON
2008
Springer
15 years 8 months ago
Changing Legal Systems: Abrogation and Annulment Part I: Revision of Defeasible Theories
Abstract. In this paper we investigate how to model legal abrogation and annulment in Defeasible Logic. We examine some options that embed in this setting, and similar rule-based s...
Guido Governatori, Antonino Rotolo
JUCS
2006
175views more  JUCS 2006»
15 years 7 months ago
The Design of the YAP Compiler: An Optimizing Compiler for Logic Programming Languages
: Several techniques for implementing Prolog in a efficient manner have been devised since the original interpreter, many of them aimed at achieving more speed. There are two main ...
Anderson Faustino da Silva, Vítor Santos Co...
FSTTCS
2000
Springer
15 years 10 months ago
Model Checking CTL Properties of Pushdown Systems
: A pushdown system is a graph G(P) of configurations of a pushdown automaton P. The model checking problem for a logic L is: given a pushdown automaton P and a formula L decide ...
Igor Walukiewicz