Results 111 to 120 of about 32,356 (302)
First-order answer set programming and classical first-order logic
, 2013 Answer Set Programming (ASP) is a form of declarative programming oriented towards difficult and primarily NP-hard search problems. Generally speaking, an ASP search problem is formulated as a theory of some language of formal logic. The formalization is
Asuncion, Vernon
core
Advanced Science, EarlyView.This study demonstrates that iron overload triggers widespread chromatin compaction and transcriptional repression in human granulosa cells, recapitulating features of endometriosis. The epigenetic reprogramming is orchestrated by a TFEB‐SOX4‐SWI/SNF axis, with SOX4 acting as a central, dosage‐sensitive regulator.
Feifei Li +15 more
wiley +1 more source
lolliCoP — A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic [PDF]
, 2001 When Prolog programs that manipulate lists to manage a collection of resources are rewritten to take advantage of the linear logic resource management provided by the logic programming language Lolli, they can obtain dramatic speedup. Thus far this has been demonstrated only for "toy" applications, such as n-queens.
Joshua S. Hodas, Naoyuki Tamura
openaire +1 more source
Haplotype‐Resolved 3D Genomic Landscapes and Their Impacts on Agronomic Traits in Grapevine
Advanced Science, EarlyView.This study presents a haplotype‐resolved 3D genomic landscape of grapevine, revealing that structural variations (SVs) are closely associated with phased topologically associating domain (TAD) boundary transitions. These rearrangements coordinate with allele‐specific DNA methylation (ASM) and allele‐biased gene expression (ASE) to shape key agronomic ...
Yanling Peng +18 more
wiley +1 more source
Intuitionistic completeness for first order classical logic
, 2017 In the past sixty years or so, a real forest of intuitionistic models for classical theories has grown. In this paper we will compare intuitionistic models of first order classical theories according to relevant issues, like completeness (w.r.t.
Berardi, Stefano
core
Cut-elimination, substitution and normalisation
, 2014 Date of Acceptance: 01/2015We present a proof (of the main parts of which there is a formal version, checked with the Isabelle proof assistant) that, for a G3-style calculus covering all of intuitionistic zero-order logic, with an associated term ...
Roy Dyckhoff, Dyckhoff, Roy
core +1 more source
First-Order Logic Formalisation of Impossibility Theorems in Preference Aggregation. [PDF]
, 2012 In preference aggregation a set of individuals express preferences over a set of alternatives, and these preferences have to be aggregated into a collective preference.
Ulle Endriss +5 more
core +1 more source
Ethical Precision in Nanoscale Brain Interfacing
Advanced Science, EarlyView.As brain interfaces approach the nanoscale, precision no longer only measures—it knows, predicts, and potentially reshapes the mind. This work argues that traditional ethics fails under such conditions and proposes a shift toward continuous, operation‐based governance using the recovery–discovery framework to track, constrain, and responsibly steer ...
Guilherme Wood
wiley +1 more source
Learning, realizability and games in classical arithmetic
, 2011 PhDAbstract. In this dissertation we provide mathematical evidence that the concept of learning can be used to give a new and intuitive computational semantics of classical proofs in various fragments of Predicative Arithmetic.
Aschieri, Federico
core
ISSUES IN THE FOUNDATIONS OF SCIENCE, I: LANGUAGES, STRUCTURES, AND MODELS [PDF]
, 2010 In this first paper of a series of works on the foundations of science, we examine the significance of logical and mathematical frameworks used in foundational studies.
Krause, Décio +2 more
core