Results 1 to 10 of about 55,588 (113)

What Dynamic Approaches Have Taught Us About Cognition and What They Have Not: On Values in Motion and the Importance of Replicable Forms

Topics in Cognitive Science, EarlyView., 2023
Abstract Over the past several decades, research in the cognitive sciences has foregrounded the importance of active bodies and their continuous dependence on the changing environment, strengthening the relevance of dynamical models. These models have been steadily developed within the ecological psychology approach to cognition, which arguably ...
Joanna Rączaszek‐Leonardi
wiley   +1 more source

Simplifying Inductive Schemes in Temporal Logic [PDF]

, 2019
In propositional temporal logic, the combination of the connectives "tomorrow" and "always in the future" require the use of induction tools. In this paper, we present a classification of inductive schemes for propositional linear temporal logic that ...
Cordero, Pablo, Fortes, Inmaculada
core   +1 more source

The Computational Complexity of Propositional Cirquent Calculus [PDF]

, 2015
Introduced in 2006 by Japaridze, cirquent calculus is a refinement of sequent calculus. The advent of cirquent calculus arose from the need for a deductive system with a more explicit ability to reason about resources.
Bauer, Matthew Steven
core   +1 more source

Towards a Systematic Account of Different Semantics for Logic Programs [PDF]

, 2005
In [Hitzler and Wendt 2002, 2005], a new methodology has been proposed which allows to derive uniform characterizations of different declarative semantics for logic programs with negation.
Hitzler, Pascal
core   +3 more sources

Logic Programming as Constructivism [PDF]

, 1989
The features of logic programming that seem unconventional from the viewpoint of classical logic can be explained in terms of constructivistic logic. We motivate and propose a constructivistic proof theory of non-Horn logic programming.
Bry, François
core   +1 more source

Reverse mathematics and well-ordering principles [PDF]

, 2011
The paper is concerned with generally Pi^1_2 sentences of the form 'if X is well ordered then f(X) is well ordered', where f is a standard proof theoretic function from ordinals to ordinals.
Rathjen, Michael, Weiermann, Andreas
core   +1 more source

The Synthesis of Logic Programs from Inductive Proofs [PDF]

, 1990
We describe a technique for synthesising logic (Prolog) programs from non-executable specifications. This technique is adapted from one for synthesising functional programs as total functions. Logic programs, on the other hand, define predicates.
Bundy, Alan, Smaill, A., Wiggins, G.
core   +1 more source

Informal proof, formal proof, formalism [PDF]

, 2015
Increases in the use of automated theorem-provers have renewed focus on the relationship between the informal proofs normally found in mathematical research and fully formalised derivations.
Weir, Alan
core   +1 more source

PSPACE Bounds for Rank-1 Modal Logics [PDF]

, 2006
For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal logics.
Pattinson, Dirk, Schröder, Lutz
core   +7 more sources

Developing visuospatial and motor skills in a child with autism: A single‐subject case study based on the Montessori approach

British Journal of Special Education, EarlyView.
Abstract Recent studies have highlighted that distinctive sensory processing may be central in explaining the communication and social interaction differences characteristic of autism. As a result, a shift in teaching approaches has been suggested, focusing on addressing sensory differences by carefully controlling perceptual stimuli (no more than two ...
Stefano Scippo
wiley   +1 more source