Results 41 to 50 of about 6,681,112 (349)
Logic frameworks for logic programs [PDF]
, 1994 We show how logical frameworks can provide a basis for logic program synthesis. With them, we may use first-order logic as a foundation to formalize and derive rules that constitute program development calculi. Derived rules may be in turn applied to synthesize logic programs using higher-order resolution during proof that programs meet their ...
openaire +3 more sources
Induction of Non-monotonic Logic Programs To Explain Statistical Learning Models [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We present a fast and scalable algorithm to induce non-monotonic logic programs from statistical learning models. We reduce the problem of search for best clauses to instances of the High-Utility Itemset Mining (HUIM) problem.
Farhad Shakerin
doaj +1 more source
FEBS Letters, EarlyView.This perspective highlights emerging insights into how the circadian transcription factor CLOCK:BMAL1 regulates chromatin architecture, cooperates with other transcription factors, and coordinates enhancer dynamics. We propose an updated framework for how circadian transcription factors operate within dynamic and multifactorial chromatin landscapes ...
Xinyu Y. Nie, Jerome S. Menet
wiley +1 more source
Testing Automation of Context-Oriented Programs Using Separation Logic
Applied Computational Intelligence and Soft Computing, 2014 A new approach for programming that enables switching among contexts of commands during program execution is context-oriented programming (COP). This technique is more structured and modular than object-oriented and aspect-oriented programming and hence ...
Mohamed A. El-Zawawy
doaj +1 more source
Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Recent developments in termination analysis for declarative programs emphasize the use of appropriate models for the logical theory representing the program at stake as a generic approach to prove termination of declarative programs.
Salvador Lucas
doaj +1 more source
FEBS Letters, EarlyView.This study reveals how the mitochondrial protein Slm35 is regulated in Saccharomyces cerevisiae. The authors identify stress‐responsive DNA elements and two upstream open reading frames (uORFs) in the 5′ untranslated region of SLM35. One uORF restricts translation, and its mutation increases Slm35 protein levels and mitophagy.
Hernán Romo‐Casanueva +5 more
wiley +1 more source
Fuzzy Assessment Algorithm for Ladder Programming
Journal of King Saud University: Engineering Sciences, 2010 This paper* proposes an assessment algorithm to measure the quality in ladder programming for programmable logic controllers (PLCs). The proposed quality metrics involve the criteria of simplicity, reconfigurability, reliability, and flexibility.
Waheid Gharieb
doaj +1 more source
Modeling and Verification of Infinite Systems with Resources [PDF]
Logical Methods in Computer Science, 2013 We consider formal verification of recursive programs with resource consumption. We introduce prefix replacement systems with non-negative integer counters which can be incremented and reset to zero as a formal model for such programs.
Martin Lang, Christof Löding
doaj +1 more source
Theory and Practice of Logic Programming, 2003 To appear in Special Issue of the Theory and Practice of Logic Programming Journal on Answer Set Programming ...
Erdem, Esra, Lifschitz, Vladimir
openaire +2 more sources
Molecular Oncology, EarlyView.This study integrates transcriptomic profiling of matched tumor and healthy tissues from 32 colorectal cancer patients with functional validation in patient‐derived organoids, revealing dysregulated metabolic programs driven by overexpressed xCT (SLC7A11) and SLC3A2, identifying an oncogenic cystine/glutamate transporter signature linked to ...
Marco Strecker +16 more
wiley +1 more source