Logic of Non-Monotonic Interactive Proofs (Formal Theory of Temporary Knowledge Transfer)

We propose a monotonic logic of internalised non-monotonic or instant interactive proofs (LiiP) and reconstruct an existing monotonic logic of internalised monotonic or persistent interactive proofs (LiP) as a minimal conservative extension of LiiP. Instant interactive proofs effect a fragile epistemic impact in their intended communities of peer reviewers that consists in the impermanent induction of the knowledge of their proof goal by means of the knowledge of the proof with the interpreting reviewer: If my peer reviewer knew my proof then she would at least then (in that instant) know that its proof goal is true. Their impact is fragile and their induction of knowledge impermanent in the sense of being the case possibly only at the instant of learning the proof. This accounts for the important possibility of internalising proofs of statements whose truth value can vary, which, as opposed to invariant statements, cannot have persistent proofs. So instant interactive proofs effect a temporary transfer of certain propositional knowledge (knowable ephemeral facts) via the transmission of certain individual knowledge (knowable non-monotonic proofs) in distributed systems of multiple interacting agents.Comment: continuation of arXiv:1201.3667 ; published extended abstract: DOI:10.1007/978-3-642-36039-8_16 ; related to arXiv:1208.591

The abstraction effect on logic rules application

The aim of this study is to analyze the relationship between training on abstraction and the comprehension of logic rules. In order to evaluate the possibility of improvement on logic performance we have selected the particular case of the DeMorgan’s laws. The dispute between the natural logic approach and the mental models theory is analyzed from the perspective of such abstraction effect. Two experiments are reported. The first one suggests that the presentation of a formal proof promotes a better comprehension of DeMorgan´s laws than the use of visual resources or colloquial examples. The second one offers a stronger test for the same abstraction effect. Some limitations concerned with the syntactic meaning of negation and the differences between constructive and evaluative conditions are discussed. Since the meaning of abstraction for the psychology of reasoning is pointed out as critical some suggestions for further research and possible educational applications are mentioned.Fil: Macbeth, Guillermo Eduardo. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Entre Ríos. Facultad de Ciencias de la Educación; ArgentinaFil: Razumiejczyk, Eugenia. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Entre Ríos. Facultad de Ciencias de la Educación; ArgentinaFil: Campitelli, Guillermo Jorge. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Edith Cowan University; Australi

A Formalization of Polytime Functions

We present a deep embedding of Bellantoni and Cook's syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to the original characterization by Cobham that required a bound to be proved manually. Compared to the paper proof by Bellantoni and Cook, we have been careful in making our proof fully contructive so that we obtain more precise bounding polynomials and more efficient translations between the two characterizations. Another difference is that we consider functions on bitstrings instead of functions on positive integers. This latter change is motivated by the application of our formalization in the context of formal security proofs in cryptography. Based on our core formalization, we have started developing a library of polytime functions that can be reused to build more complex ones.Comment: 13 page

A Survey of Languages for Specifying Dynamics: A Knowledge Engineering Perspective

A number of formal specification languages for knowledge-based systems has been developed. Characteristics for knowledge-based systems are a complex knowledge base and an inference engine which uses this knowledge to solve a given problem. Specification languages for knowledge-based systems have to cover both aspects. They have to provide the means to specify a complex and large amount of knowledge and they have to provide the means to specify the dynamic reasoning behavior of a knowledge-based system. We focus on the second aspect. For this purpose, we survey existing approaches for specifying dynamic behavior in related areas of research. In fact, we have taken approaches for the specification of information systems (Language for Conceptual Modeling and TROLL), approaches for the specification of database updates and logic programming (Transaction Logic and Dynamic Database Logic) and the generic specification framework of abstract state machine

Communication of military couples during deployment predicting generalized anxiety upon reunion

This study draws on the emotional cycle of deployment model (Pincus, House, Christenson, & Adler, 2001) to consider how the valence of communication between military personnel and at-home partners during deployment predicts their generalized anxiety upon reunion. Online survey data were collected from 555 military couples (N = 1,110 individuals) once per month for 8 consecutive months beginning at homecoming. Dyadic growth curve modeling results indicated that people’s anxiety declined across the transition. For at-home partners, constructive communication during deployment predicted a steeper decline in anxiety over time. For both returning service members and at-home partners, destructive communication during deployment predicted more anxiety upon reunion but a steeper decline in anxiety over time. Results were robust beyond the frequency of communication during deployment and a host of individual, relational, and military variables. These findings advance the emotional cycle of deployment model, highlight the importance of the valence of communication during deployment, and illuminate how the effects of communication during deployment can endure after military couples are reunited

MELT - a Translated Domain Specific Language Embedded in the GCC Compiler

The GCC free compiler is a very large software, compiling source in several languages for many targets on various systems. It can be extended by plugins, which may take advantage of its power to provide extra specific functionality (warnings, optimizations, source refactoring or navigation) by processing various GCC internal representations (Gimple, Tree, ...). Writing plugins in C is a complex and time-consuming task, but customizing GCC by using an existing scripting language inside is impractical. We describe MELT, a specific Lisp-like DSL which fits well into existing GCC technology and offers high-level features (functional, object or reflexive programming, pattern matching). MELT is translated to C fitted for GCC internals and provides various features to facilitate this. This work shows that even huge, legacy, software can be a posteriori extended by specifically tailored and translated high-level DSLs.Comment: In Proceedings DSL 2011, arXiv:1109.032