Results 71 to 80 of about 47,472 (286)
The ghosts of forgotten things: A study on size after forgetting
, 2020 Forgetting is removing variables from a logical formula while preserving the constraints on the other variables. In spite of being a form of reduction, it does not always decrease the size of the formula and may sometimes increase it.
Liberatore, Paolo
core
Forgetting complex propositions
, 2015 This paper uses possible-world semantics to model the changes that may occur in an agent's knowledge as she loses information. This builds on previous work in which the agent may forget the truth-value of an atomic proposition, to a more general case ...
Fernández-Duque, David +4 more
core +1 more source
Quantum Carnot Bound from Petz Recovery Maps
Advanced Physics Research, EarlyView.A quantum bound (ηP$\eta_P$, the Petz Limit) is derived for the efficiency (η$\eta$) of a heat engine utilizing two‐level quantum systems (qubits) as the working substance. This limit, based on Petz recovery maps, is stricter than the classical Carnot limit (ηC$\eta_C$) for irreversible cycles.
Douglas Mundarain +2 more
wiley +1 more source
Identifying Soft Cores in Propositional Formulæ
Proceedings of the 14th International Conference on Agents and Artificial Intelligence, 2022 In view of the emergence of explainable AI, many new concepts intend to explain why systems exhibit certain behaviors while other behaviors are excluded. When dealing with constraints, explanations can take the form of subsets having few solutions, while being sufficiently small for ensuring that they are intelligible enough.
Audemard, Gilles +3 more
openaire +1 more source
Efficient Dynamics: Reduced‐Order Modeling of the Time‐Dependent Schrödinger Equation
Advanced Physics Research, EarlyView.Reduced‐order modeling (ROM) approaches for the time‐dependent Schrödinger equation are investigated, highlighting their ability to simulate quantum dynamics efficiently. Proper Orthogonal Decomposition, Dynamic Mode Decomposition, and Reduced Basis Methods are compared across canonical systems and extended to higher dimensions.
Kolade M. Owolabi
wiley +1 more source
The Anatomical Record, EarlyView.Abstract Last year, we challenged the view that large‐bodied theropod dinosaurs such as Tyrannosaurus rex resembled primates in cognition and behavior, a proposition made by Herculano‐Houzel in 2023. More recently, Jensen et al. have criticized our work on this topic, raising methodological and conceptual issues.
Kai R. Caspar +5 more
wiley +1 more source
Risk‐aware safe reinforcement learning for control of stochastic linear systems
Asian Journal of Control, EarlyView.Abstract This paper presents a risk‐aware safe reinforcement learning (RL) control design for stochastic discrete‐time linear systems. Rather than using a safety certifier to myopically intervene with the RL controller, a risk‐informed safe controller is also learned besides the RL controller, and the RL and safe controllers are combined together ...
Babak Esmaeili +2 more
wiley +1 more source
About Logically Probable Sentences
Bulletin of the Section of LogicThe starting point of this paper is the empirically determined ability to reason in natural language by employing probable sentences. A sentence is understood to be logically probable if its schema, expressed as a formula in the language of classical ...
Adam Olszewski
doaj +1 more source
DECISION PROBLEMS AND RECURSIVENESS IN FORMAL LOGIC SYSTEMS
Revista de Matemática: Teoría y Aplicaciones, 2017 The recursion theory states that a decision problem is recursively solvable if there is a mechanical process to solve it. Within the context of formal logic, the decision problem consist to determine whether any wellformed formula of the system is a ...
Iveth Martínez, Eduardo Piza
doaj +1 more source
A modal logic amalgam of classical and intuitionistic propositional logic
, 2015 A famous result, conjectured by G\"odel in 1932 and proved by McKinsey and Tarski in 1948, says that $\varphi$ is a theorem of intuitionistic propositional logic IPC iff its G\"odel-translation $\varphi'$ is a theorem of modal logic S4. In this paper, we
Lewitzka, Steffen
core +1 more source