Conceptual Graphs and Formal Concept Analysis are combined by developing a logical theory for concept graphs of relational contexts. Therefore, concept graphs are introduced as syntactical constructs , and their semantics is deened based on relational contexts. For this contextual logic, a sound and complete system of inference rules is presented and a standard graph is introduced that entails ...

Tinkering is often viewed as arbitrary practice that should be avoided. However, tinkering can performed part of a sound reasoning process. In this ethnomethodological study, we investigated process construes logical inferences. This new asset-based approach applied in computer science education. We analyzed artifact-based interviews, video observations, reflections, and scaffolding entries fro...

We introduce the declarative programming language Indeed that uses both deduction and interaction through multi-agent system applications. The language design is addressed by providing a uniform programming model that combines two refinements of resolution along with some control strategies to introduce state-based descriptions. We show that the logical calculus in which the computational model...

We propose a method to extract purely functional contents from logical inductive types in the context of the Calculus of Inductive Constructions. This method is based on a mode consistency analysis, which veri es if a computation is possible w.r.t. the selected inputs/outputs, and the code generation itself. We prove that this extraction is sound w.r.t. the Calculus of Inductive Constructions. ...