A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
These restart model elimination calculi are proven sound and complete. ... The corresponding proof procedures are evaluated by a number of runtime experiments and they are compared to other well known provers. ... It is obvious that for reasons of efficiency a proof procedure based on this calculus must provide some refinements. ...doi:10.1007/3-540-58156-1_7 fatcat:vsr2p3csifb27bs67lw6iejko4
Design can be seen as a reasoning process based on non-classic logic, in which non-monotonicity and abduction are two essential features. ... This paper introduces Abductive Propositional Logic (APL), which is a simple but powerful formal system to deal with these two features. ... Gabbay's (1996) labeled deductive systems. For a comprehensive survey of the non-monotonic logics, see (Cadoli and Schaerf, 1993) . ...doi:10.1080/02533839.2001.9670653 fatcat:mca4n3ufkneblb6tn26e4slxqu
On the other hand, Abrusci's paper is a historical presentation of the emergence of epsilon and tau on the proof theoretic foundations of mathematics in the works of Hilbert and his followers. ... This special issue of the Journal of Logics and their Applications follows a workshop organized in Montpellier in June 12-15 2015. ... The authors would like to thank: Christian Retoré for organizing the workshop on Hilbert's Epsilon and Tau in Logic, Informatics and Linguistics; the anonymous reviewers of this workshop for providing ...dblp:journals/flap/DeVidiM17 fatcat:r2sm6fbvtncsziyterc76pw46m
This study introduces Grounded Discourse Representation Theory (GDRT), a formalism for the semantics-pragmatics interface of a robot in the framework of goal-oriented human-machine collaboration. ... From a technical point of view, GDRT embeds the established formalism of Discourse Representation Theory (DRT) into a system of Computational Tree Logic and the Procedural Reasoning System. ... The 'logic' of an agent's beliefs is also specified in syntactic terms e.g. in the form of a proof system based on deduction rules together with a proof manager responsible for updating the given belief ...doi:10.18419/opus-2662 fatcat:szfydizljjfgvb2ramfjj6rbui