生物计算 · 全部实体（第 60 / 100 页）

本页收录第 5901–6000 条，共 10000 条 · 返回 生物计算 首页

• Singapore and Pandemic Regulation
  Singapore's legal and regulatory approach towards regulating COVID-19
  preprints 2021 置信度 0.74
• QSAR-QMMM Cryptographic Mining on Chern-Simons Topologies for the generation of a Ligand Targeting SARS-COV-2 D614G Binding Sites.
  SARS coronavirus 2 (SARS-CoV-2) in the viral spike (S) encoding a SARS-COV-2 SPIKE D614G mutation protein predominate over time in locales revealing the dynamic aspects of its key viral processes where it is found, implying that this change enhances viral tran…
  preprints 2021 置信度 0.74
• Inequalities, Innovation, and Patents
  Over the last several decades, the United States has become more innovative and more unequal. As technology is blamed for destroying democracy and jobs and Covid lays bare health and digital inequalities, the question of how innovation’s benefits are distribut…
  preprints 2018 置信度 0.74
• A reconfigurable NAND/NOR genetic logic gate.
  Background Engineering genetic Boolean logic circuits is a major research theme of synthetic biology. By altering or introducing connections between genetic components, novel regulatory networks are built in order to mimic the behaviour of electronic devices s…
  europepmc 2012 置信度 0.80
• Logic Optimization for Majority Gate-Based Nanoelectronic Circuits Based on Genetic Algorithm
  In this paper we propose a novel and efficient method for majority gate-based design. The basic Boolean primitive in quantum cellular automata (QCA) is the majority gate. Method for reducing the number of majority gates required for computing Boolean functions…
  crossref M.R. Bonyadi, S.M.R. Azghadi, N.M. Rad, K. Navi 等 2007-08-22T15:35:32Z 置信度 0.70
• Tuning Ultrasensitivity in Genetic Logic Gates Using Antisense RNA Feedback.
  Inverting genetic logic gates fueled by transcriptional repression is an established building block in genetic circuit design. Often, the gates' dose-response curves require large changes in dose to transition between logic ON and OFF states, potentially leadi…
  europepmc 2024 置信度 0.80
• The prospects for mathematical logic in the twenty-first century
  The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently.
  arxiv Samuel R. Buss, Alexander S. Kechris, Anand Pillay, Richard A. Shore 2002-05-03T22:36:23Z 置信度 0.78 cs.LO
• Embedding Defeasible Logic into Logic Programming
  Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of defeasible reasoning metho…
  arxiv Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher 2005-11-15T10:39:38Z 置信度 0.78 cs.LO
• Syllogistic Logic with Cardinality Comparisons, On Infinite Sets
  This paper enlarges classical syllogistic logic with assertions having to do with comparisons between the sizes of sets. So it concerns a logical system whose sentences are of the following forms: {\sf All $x$ are $y$} and {\sf Some $x$ are $y$}, {\sf There ar…
  arxiv Lawrence S. Moss, Selçuk Topal 2017-05-08T18:24:54Z 置信度 0.78 math.LO
• Quantitative Logic Reasoning
  In this paper we show several similarities among logic systems that deal simultaneously with deductive and quantitative inference. We claim it is appropriate to call the tasks those systems perform as Quantitative Logic Reasoning. Analogous properties hold thr…
  arxiv Marcelo Finger 2019-05-14T15:19:30Z 置信度 0.78 cs.LOcs.AI
• Stable Canonical Rules for Intuitionistic Modal Logics
  This paper develops stable canonical rules for intuitionistic modal logics, which were first introduced for superintuitionistic logics and transitive nor mal modal logics in [1] and [2] respectively. We first prove that every in tuitionistic modal multi-conclu…
  arxiv Cheng Liao 2026-02-10T02:33:26Z 置信度 0.78 math.LO
• Disjunctive Logic Programs with Inheritance
  The paper proposes a new knowledge representation language, called DLP<, which extends disjunctive logic programming (with strong negation) by inheritance. The addition of inheritance enhances the knowledge modeling features of the language providing a natu…
  arxiv Francesco Buccafurri, Wolfgang Faber, Nicola Leone 2001-05-30T20:32:49Z 置信度 0.78 cs.LOcs.AI
• Papers presented at the 32nd International Conference on Logic Programming (ICLP 2016)
  This is the list of the full papers accepted for presentation at the 32nd International Conference on Logic Programming, New York City, USA, October 18-21, 2016. In addition to the main conference itself, ICLP hosted four pre-conference workshops, the Autumn S…
  arxiv Manuel Carro, Andy King 2016-08-18T21:58:34Z 置信度 0.78 cs.PLcs.LO
• Category theory, logic and formal linguistics: some connections, old and new
  We seize the opportunity of the publication of selected papers from the \emph{Logic, categories, semantics} workshop in the \emph{Journal of Applied Logic} to survey some current trends in logic, namely intuitionistic and linear type theories, that interweave …
  arxiv Jean Gillibert, Christian Retoré 2014-01-25T19:54:18Z 置信度 0.78 math.CTcs.CLcs.LOmath.LO
• Optimizing Probabilities in Probabilistic Logic Programs
  Probabilistic Logic Programming is an effective formalism for encoding problems characterized by uncertainty. Some of these problems may require the optimization of probability values subject to constraints among probability distributions of random variables. …
  arxiv Damiano Azzolini, Fabrizio Riguzzi 2021-08-06T13:03:19Z 置信度 0.78 cs.LO
• Splitting Epistemic Logic Programs
  Epistemic logic programs constitute an extension of the stable models semantics to deal with new constructs called subjective literals. Informally speaking, a subjective literal allows checking whether some regular literal is true in all stable models or in so…
  arxiv Pedro Cabalar, Jorge Fandinno, Luis Fariñas del Cerro 2018-12-20T18:45:08Z 置信度 0.78 cs.AIcs.LO
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
  Probabilistic logic programs are logic programs in which some of the facts are annotated with probabilities. This paper investigates how classical inference and learning tasks known from the graphical model community can be tackled for probabilistic logic prog…
  arxiv Daan Fierens, Guy Van den Broeck, Joris Renkens, Dimitar Shterionov 等 2013-04-25T06:10:55Z 置信度 0.78 cs.AIcs.LGcs.LO
• Integrating Belief Domains into Probabilistic Logic Programs
  Probabilistic Logic Programming (PLP) under the Distribution Semantics is a leading approach to practical reasoning under uncertainty. An advantage of the Distribution Semantics is its suitability for implementation as a Prolog or Python library, available thr…
  arxiv Damiano Azzolini, Fabrizio Riguzzi, Theresa Swift 2025-07-23T07:52:09Z 置信度 0.78 cs.LOcs.AI
• Logic Programming for Finding Models in the Logics of Knowledge and its Applications: A Case Study
  The logics of knowledge are modal logics that have been shown to be effective in representing and reasoning about knowledge in multi-agent domains. Relatively few computational frameworks for dealing with computation of models and useful transformations in log…
  arxiv Chitta Baral, Gregory Gelfond, Enrico Pontelli, Tran Cao Son 2010-07-21T17:44:02Z 置信度 0.78 cs.AIcs.LO
• Exploring the Jungle of Intuitionistic Temporal Logics
  The importance of intuitionistic temporal logics in Computer Science and Artificial Intelligence has become increasingly clear in the last few years. From the proof-theory point of view, intuitionistic temporal logics have made it possible to extend functional…
  arxiv Joseph Boudou, Martín Diéguez, David Fernández-Duque, Philip Kremer 2019-12-30T11:55:20Z 置信度 0.78 cs.LO
• Cheating for Problem Solving: A Genetic Algorithm with Social Interactions
  We propose a variation of the standard genetic algorithm that incorporates social interaction between the individuals in the population. Our goal is to understand the evolutionary role of social systems and its possible application as a non-genetic new step in…
  arxiv Rafeal Lahoz-Beltra, Gabriela Ochoa, Uwe Aickelin 2010-01-12T14:35:42Z 置信度 0.78 cs.NEcs.AIcs.GT
• Intuitionistic Epistemic Logic
  We outline an intuitionistic view of knowledge which maintains the original Brou\-wer-Heyting-Kolmogorov semantics for intuitionism and is consistent with the well-known approach that intuitionistic knowledge be regarded as the result of verification. We argue…
  arxiv Sergei Artemov, Tudor Protopopescu 2014-06-06T04:42:36Z 置信度 0.78 math.LO
• Annotated Defeasible Logic
  Defeasible logics provide several linguistic features to support the expression of defeasible knowledge. There is also a wide variety of such logics, expressing different intuitions about defeasible reasoning. However, the logics can only combine in trivial wa…
  arxiv Guido Governatori, Michael J. Maher 2017-07-15T13:41:00Z 置信度 0.78 cs.LO
• The Third Life of Quantum Logic: Quantum Logic Inspired by Quantum Computing
  We begin by discussing the history of quantum logic, dividing it into three eras or lives. The first life has to do with Birkhoff and von Neumann's algebraic approach in the 1930's. The second life has to do with attempt to understand quantum logic as logic th…
  arxiv J. Michael Dunn, Lawrence S. Moss, Zhenghan Wang 2013-02-14T16:51:13Z 置信度 0.78 math.LOcs.LOquant-ph
• Trichotomy and Dichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs
  We present trichotomy results characterizing the complexity of reasoning with disjunctive logic programs. To this end, we introduce a certain definition schema for classes of programs based on a set of allowed arities of rules. We show that each such class of …
  arxiv Miroslaw Truszczynski 2010-07-16T17:07:25Z 置信度 0.78 cs.LO
• Inquisitive Logic as an Epistemic Logic of Knowing How
  In this paper, we present an alternative interpretation of propositional inquisitive logic as an epistemic logic of knowing how. In our setting, an inquisitive logic formula $α$ being supported by a state is formalized as "knowing how to resolve $α$" (more col…
  arxiv Haoyu Wang, Yanjing Wang, Yunsong Wang 2022-03-23T07:59:11Z 置信度 0.78 math.LOcs.LO
• Deterministic modal Bayesian Logic: derive the Bayesian inference within the modal logic T
  In this paper a conditional logic is defined and studied. This conditional logic, DmBL, is constructed as a deterministic counterpart to the Bayesian conditional. The logic is unrestricted, so that any logical operations are allowed. A notion of logical indepe…
  arxiv Frederic Dambreville 2007-01-28T08:57:01Z 置信度 0.78 math.LOcs.LOmath.PR
• On an ordinary expansion of first-order Belnap-Dunn logic
  This paper concerns an expansion of first-order Belnap-Dunn logic whose connectives and quantifiers all have a counterpart in classical logic. The language and logical consequence relation of this paradefinite logic are defined, a sequent calculus proof system…
  arxiv C. A. Middelburg 2023-01-25T12:49:25Z 置信度 0.78 cs.LOmath.LO
• Tight Logic Programs
  This note is about the relationship between two theories of negation as failure -- one based on program completion, the other based on stable models, or answer sets. Francois Fages showed that if a logic program satisfies a certain syntactic condition, which i…
  arxiv Esra Erdem, Vladimir Lifschitz 2003-02-28T01:28:22Z 置信度 0.78 cs.AIcs.LO
• A Simple Logic of Functional Dependence
  This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized assignment semantics fo…
  arxiv Alexandru Baltag, Johan van Benthem 2021-03-27T17:03:03Z 置信度 0.78 cs.LOmath.LO
• On the Implementation of the Probabilistic Logic Programming Language ProbLog
  The past few years have seen a surge of interest in the field of probabilistic logic learning and statistical relational learning. In this endeavor, many probabilistic logics have been developed. ProbLog is a recent probabilistic extension of Prolog motivated …
  arxiv Angelika Kimmig, Bart Demoen, Luc De Raedt, Vítor Santos Costa 等 2010-06-23T08:05:34Z 置信度 0.78 cs.PLcs.LGcs.LO
• A Logic Framework for P2P Deductive Databases
  This paper presents a logic framework for modeling the interaction among deductive databases in a P2P (Peer to Peer) environment. Each peer joining a P2P system provides or imports data from its neighbors by using a set of mapping rules, i.e. a set of semantic…
  arxiv Luciano Caroprese, Ester Zumpano 2019-05-04T19:39:06Z 置信度 0.78 cs.LO
• The logic of contextuality
  Contextuality is a key signature of quantum non-classicality, which has been shown to play a central role in enabling quantum advantage for a wide range of information-processing and computational tasks. We study the logic of contextuality from a structural po…
  arxiv Samson Abramsky, Rui Soares Barbosa 2020-11-05T19:04:04Z 置信度 0.78 quant-phcs.LOmath.LO
• Predicting Friction System Performance with Symbolic Regression and Genetic Programming with Factor Variables
  Friction systems are mechanical systems wherein friction is used for force transmission (e.g. mechanical braking systems or automatic gearboxes). For finding optimal and safe design parameters, engineers have to predict friction system performance. This is esp…
  arxiv Gabriel Kronberger, Michael Kommenda, Andreas Promberger, Falk Nickel 2021-07-19T16:10:27Z 置信度 0.78 cs.LGcs.NE
• Truth-value semantics and functional extensions for classical logic of partial terms based on equality
  We develop a bottom-up approach to truth-value semantics for classical logic of partial terms based on equality and apply it to prove the conservativity of the addition of partial description and partial selection functions, independently of any strictness ass…
  arxiv Franco Parlamento 2011-12-29T15:32:55Z 置信度 0.78 math.LO
• A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
  Graded modal logic is the formal language obtained from ordinary (propositional) modal logic by endowing its modal operators with cardinality constraints. Under the familiar possible-worlds semantics, these augmented modal operators receive interpretations suc…
  arxiv Yevgeny Kazakov, Ian Pratt-Hartmann 2009-05-19T15:27:04Z 置信度 0.78 cs.LOcs.AIcs.CC
• Improving Evaluation of Recombination-based Cartesian Genetic Programming
  Cartesian Genetic Programming has traditionally been using mutation as its main and often sole genetic operator to drive evolutionary search. Despite advancements in recent years, recombinationbased approaches have long been avoided, due to apparent lack of pe…
  arxiv Duy Long Tran, Anja Jankovic, Marie Anastacio, Holger Hoos 等 2026-05-27T11:54:14Z 置信度 0.78 cs.NEcs.AIcs.SC
• Predicate Logic as a Modeling Language: Modeling and Solving some Machine Learning and Data Mining Problems with IDP3
  This paper provides a gentle introduction to problem solving with the IDP3 system. The core of IDP3 is a finite model generator that supports first order logic enriched with types, inductive definitions, aggregates and partial functions. It offers its users a …
  arxiv Maurice Bruynooghe, Hendrik Blockeel, Bart Bogaerts, Broes De Cat 等 2013-09-26T13:18:05Z 置信度 0.78 cs.LOcs.AI
• Non-Termination of Logic Programs Using Patterns
  In this paper, we consider an approach introduced in term rewriting for the automatic detection of non-looping non-termination from patterns of rules. We adapt it to logic programming by defining a new unfolding technique that produces patterns describing poss…
  arxiv Etienne Payet 2025-07-12T20:16:49Z 置信度 0.78 cs.LO
• Logics for complexity classes
  A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered structures, and another form t…
  arxiv Vladimir Naidenko 2013-12-17T05:54:04Z 置信度 0.78 cs.CCcs.LO
• Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting
  In a recent line of research, two familiar concepts from logic programming semantics (unfounded sets and splitting) were extrapolated to the case of epistemic logic programs. The property of epistemic splitting provides a natural and modular way to understand …
  arxiv Jorge Fandinno 2019-07-22T11:48:15Z 置信度 0.78 cs.LOcs.AI
• Modal logic, fundamentally
  Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal logics via algebraic rep…
  arxiv Wesley H. Holliday 2024-03-20T23:46:29Z 置信度 0.78 math.LOcs.LO
• Dynamic Cantor Derivative Logic
  Topological semantics for modal logic based on the Cantor derivative operator gives rise to derivative logics, also referred to as $d$-logics. Unlike logics based on the topological closure operator, $d$-logics have not previously been studied in the framework…
  arxiv David Fernández-Duque, Yoàv Montacute 2021-07-21T20:32:30Z 置信度 0.78 math.LOcs.LO
• Deterministic modal Bayesian Logic: derive the Bayesian within the modal logic T
  In this paper a conditional logic is defined and studied. This conditional logic, DmBL, is constructed as close as possible to the Bayesian and is unrestricted, that is one is able to use any operator without restriction. A notion of logical independence is al…
  arxiv Frederic Dambreville 2005-09-12T06:11:18Z 置信度 0.78 math.LOcs.LOmath.PR
• Base-extension Semantics for Modal Logic
  In proof-theoretic semantics, meaning is based on inference. It may seen as the mathematical expression of the inferentialist interpretation of logic. Much recent work has focused on base-extension semantics, in which the validity of formulas is given by an in…
  arxiv Timo Eckhardt, David J. Pym 2024-01-24T17:04:26Z 置信度 0.78 math.LOcs.LO
• Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents
  We provide a direct method for proving Craig interpolation for a range of modal and intuitionistic logics, including those containing a "converse" modality. We demonstrate this method for classical tense logic, its extensions with path axioms, and for bi-intui…
  arxiv Tim Lyon, Alwen Tiu, Rajeev Goré, Ranald Clouston 2019-10-11T14:32:27Z 置信度 0.78 cs.LOmath.LO
• Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic
  Takeuti and Titani have introduced and investigated a logic they called intuitionistic fuzzy logic. This logic is characterized as the first-order Goedel logic based on the truth value set [0,1]. The logic is known to be axiomatizable, but no deduction system …
  arxiv Matthias Baaz, Richard Zach 2000-05-18T09:28:39Z 置信度 0.78 math.LO
• Formula size games for modal logic and $μ$-calculus
  We propose a new version of formula size game for modal logic. The game characterizes the equivalence of pointed Kripke-models up to formulas of given numbers of modal operators and binary connectives. Our game is similar to the well-known Adler-Immerman game.…
  arxiv Lauri Hella, Miikka Vilander 2019-12-17T06:39:49Z 置信度 0.78 cs.LO
• Modular many-valued semantics for combined logics
  We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic logical matrices. Our…
  arxiv Carlos Caleiro, Sérgio Marcelino 2022-02-04T15:32:20Z 置信度 0.78 math.LOcs.LO
• Under Lock and Key: A Proof System for a Multimodal Logic
  We present a proof system for a multimodal logic, based on our previous work on a multimodal Martin-Loef type theory. The specification of modes, modalities, and implications between them is given as a mode theory, i.e. a small 2-category. The logic is extende…
  arxiv G. A. Kavvos, Daniel Gratzer 2022-11-11T14:13:07Z 置信度 0.78 cs.LOmath.LO
• A Framework for Intuitionistic Grammar Logics
  We generalize intuitionistic tense logics to the multi-modal case by placing grammar logics on an intuitionistic footing. We provide axiomatizations for a class of base intuitionistic grammar logics as well as provide axiomatizations for extensions with combin…
  arxiv Tim S. Lyon 2021-10-02T13:10:52Z 置信度 0.78 math.LOcs.LO
• Quantum computational logic with mixed states
  Using an algebraic framework we solve a problem posed in [5] and [7] about the axiomatizability of a quantum computational type logic related to fuzzy logic. A Hilbert-style calculus is developed obtaining an algebraic strong completeness theorem.
  arxiv Hector Freytes, Graciela Domenech 2010-02-26T16:54:47Z 置信度 0.78 quant-ph
• Programming in logic without logic programming
  In previous work, we proposed a logic-based framework in which computation is the execution of actions in an attempt to make reactive rules of the form if antecedent then consequent true in a canonical model of a logic program determined by an initial state, s…
  arxiv Robert Kowalski, Fariba Sadri 2016-01-04T15:09:38Z 置信度 0.78 cs.AI
• The Magic of Logical Inference in Probabilistic Programming
  Today, many different probabilistic programming languages exist and even more inference mechanisms for these languages. Still, most logic programming based languages use backward reasoning based on SLD resolution for inference. While these methods are typicall…
  arxiv Bernd Gutmann, Ingo Thon, Angelika Kimmig, Maurice Bruynooghe 等 2011-07-26T09:58:08Z 置信度 0.78 cs.LO
• A Many-Sorted Variant of Japaridze's Polymodal Provability Logic
  We consider a many-sorted variant of Japaridze's polymodal provability logic $\mathsf{GLP}$. In this variant, which is denoted $\mathsf{GLP}^\ast$, propositional variables are assigned sorts $α\leq ω$, where variables of finite sort $n < ω$ are interpreted …
  arxiv Gerald Berger, Lev D. Beklemishev, Hans Tompits 2016-01-12T13:44:27Z 置信度 0.78 math.LO
• Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
  Answer set programming is a prominent declarative programming paradigm used in formulating combinatorial search problems and implementing different knowledge representation formalisms. Frequently, several related and yet substantially different answer set prog…
  arxiv Yuliya Lierler 2019-01-26T00:28:58Z 置信度 0.78 cs.AIcs.LO
• The Expressive Power of k-ary Exclusion Logic
  In this paper we study the expressive power of k-ary exclusion logic, EXC[k], that is obtained by extending first order logic with k-ary exclusion atoms. It is known that without arity bounds exclusion logic is equivalent with dependence logic. By observing th…
  arxiv Raine Rönnholm 2016-05-05T18:37:32Z 置信度 0.78 math.LOcs.LO
• Topos Quantum Logic and Mixed States
  The topos approach to the formulation of physical theories includes a new form of quantum logic. We present this topos quantum logic, including some new results, and compare it to standard quantum logic, all with an eye to conceptual issues. In particular, we …
  arxiv Andreas Doering 2010-04-20T20:24:01Z 置信度 0.78 quant-phmath-phmath.LO
• Topological representation of intuitionistic and distributive abstract logics
  We continue work of our earlier paper (Lewitzka and Brunner: Minimally generated abstract logics, Logica Universalis 3(2), 2009), where abstract logics and particularly intuitionistic abstract logics are studied. Abstract logics can be topologized in a direct …
  arxiv Andreas B. M. Brunner, Steffen Lewitzka 2015-08-18T20:01:48Z 置信度 0.78 cs.LOmath.LO
• On Uniform Equivalence of Epistemic Logic Programs
  Epistemic Logic Programs (ELPs) extend Answer Set Programming (ASP) with epistemic negation and have received renewed interest in recent years. This led to the development of new research and efficient solving systems for ELPs. In practice, ELPs are often writ…
  arxiv Wolfgang Faber, Michael Morak, Stefan Woltran 2019-07-25T09:34:13Z 置信度 0.78 cs.LOcs.AI
• TinyverseGP: Towards a Modular Cross-domain Benchmarking Framework for Genetic Programming
  Over the years, genetic programming (GP) has evolved, with many proposed variations, especially in how they represent a solution. Being essentially a program synthesis algorithm, it is capable of tackling multiple problem domains. Current benchmarking initiati…
  arxiv Roman Kalkreuth, Fabricio Olivetti de França, Julian Dierkes, Marie Anastacio 等 2025-04-14T14:14:27Z 置信度 0.78 cs.NEcs.LGcs.SC
• An asymptotic analysis of probabilistic logic programming, with implications for expressing projective families of distributions
  Probabilistic logic programming is a major part of statistical relational artificial intelligence, where approaches from logic and probability are brought together to reason about and learn from relational domains in a setting of uncertainty. However, the beha…
  arxiv Felix Weitkämper 2021-02-17T14:07:16Z 置信度 0.78 cs.LOcs.AIcs.PLmath.LO
• Wijesekera-style constructive modal logics
  We define a family of propositional constructive modal logics corresponding each to a different classical modal system. The logics are defined in the style of Wijesekera's constructive modal logic, and are both proof-theoretically and semantically motivated. O…
  arxiv Tiziano Dalmonte 2022-10-18T15:38:54Z 置信度 0.78 math.LOcs.LO
• Decidability of predicate logics with team semantics
  We study the complexity of predicate logics based on team semantics. We show that the satisfiability problems of two-variable independence logic and inclusion logic are both NEXPTIME-complete. Furthermore, we show that the validity problem of two-variable depe…
  arxiv Juha Kontinen, Antti Kuusisto, Jonni Virtema 2014-10-19T05:14:54Z 置信度 0.78 cs.LOcs.CCmath.LO
• Some problems with two axiomatizations of discussive logic
  Problems in two axiomatizations of Jaśkowski's discussive (or discursive) logic D2 are considered. A recent axiomatization of D2 and completeness proof relative to D2's intended semantics seems to be mistaken because some formulas valid according to the intend…
  arxiv Jesse Alama 2014-03-30T15:52:55Z 置信度 0.78 math.LOcs.LO
• Capturing k-ary Existential Second Order Logic with k-ary Inclusion-Exclusion Logic
  In this paper we analyze k-ary inclusion-exclusion logic, INEX[k], which is obtained by extending first order logic with k-ary inclusion and exclusion atoms. We show that every formula of INEX[k] can be expressed with a formula of k-ary existential second orde…
  arxiv Raine Rönnholm 2015-02-19T17:20:25Z 置信度 0.78 math.LOcs.LO
• Adequate Losses via Quantitative Linear Logic
  As neural components are increasingly embedded in existing symbolic software -- including safety-critical systems -- the question arises of how to specify and enforce the safety of the newly introduced neural parts. Unlike traditional logical specifications, t…
  arxiv Matteo Capucci, Robert Atkey, Charles Grellois, Ekaterina Komendantskaya 等 2026-05-13T11:05:08Z 置信度 0.78 cs.LOmath.LO
• Flexible coinductive logic programming
  Recursive definitions of predicates are usually interpreted either inductively or coinductively. Recently, a more powerful approach has been proposed, called flexible coinduction, to express a variety of intermediate interpretations, necessary in some cases to…
  arxiv Francesco Dagnino, Davide Ancona, Elena Zucca 2020-08-05T13:57:21Z 置信度 0.78 cs.PLcs.LO
• Cantor Derivative Logic in Topological Dynamics
  Topological semantics for modal logic based on the Cantor derivative operator gives rise to derivative logics, also referred to as d-logics. Unlike logics based on the topological closure operator, d-logics have not previously been studied in the framework of …
  arxiv Yoàv Montacute 2023-02-01T20:34:01Z 置信度 0.78 math.LOcs.LO
• Operational quantum logic: An overview
  The term quantum logic has different connotations for different people, having been considered as everything from a metaphysical attack on classical reasoning to an exercise in abstract algebra. Our aim here is to give a uniform presentation of what we call op…
  arxiv Bob Coecke, David Moore, Alexander Wilce 2000-08-03T15:26:32Z 置信度 0.78 quant-phmath-phmath.LO
• Algebraizable Weak Logics
  We extend the framework of abstract algebraic logic to weak logics, namely logical systems which are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate and we introduce a loose and stri…
  arxiv Georgi Nakov, Davide Emilio Quadrellaro 2022-10-12T09:35:32Z 置信度 0.78 math.LO
• An Automated Testing and Debugging Toolkit for Gate-Level Logic Synthesis Applications
  Correctness and robustness are essential for logic synthesis applications, but they are often only tested with a limited set of benchmarks. Moreover, when the application fails on a large benchmark, the debugging process may be tedious and time-consuming. In s…
  arxiv Siang-Yun Lee, Heinz Riener, Giovanni De Micheli 2022-07-17T11:19:44Z 置信度 0.78 cs.SEcs.LO
• Sequent-Type Proof Systems for Three-Valued Default Logic
  Sequent-type proof systems constitute an important and widely-used class of calculi well-suited for analysing proof search. In my master's thesis, I introduce sequent-type calculi for a variant of default logic employing \Lukasiewicz's three-valued logic as th…
  arxiv Sopo Pkhakadze 2019-05-12T13:59:46Z 置信度 0.78 cs.LOmath.LO
• Verifying Tight Logic Programs with anthem and Vampire
  This paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of program completion to programs with input and output in a subset of the input language of the ASP gro…
  arxiv Jorge Fandinno, Vladimir Lifschitz, Patrick Lühne, Torsten Schaub 2020-08-05T10:01:33Z 置信度 0.78 cs.LOcs.AI
• Propositional Defeasible Logic has Linear Complexity
  Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts markedly with most other…
  arxiv Michael J. Maher 2004-05-24T15:45:59Z 置信度 0.78 cs.AI
• Canonical Proof nets for Classical Logic
  Proof nets provide abstract counterparts to sequent proofs modulo rule permutations; the idea being that if two proofs have the same underlying proof-net, they are in essence the same proof. Providing a convincing proof-net counterpart to proofs in the classic…
  arxiv Richard McKinley 2012-03-19T12:00:45Z 置信度 0.78 math.LOcs.LO
• MAP Inference for Probabilistic Logic Programming
  In Probabilistic Logic Programming (PLP) the most commonly studied inference task is to compute the marginal probability of a query given a program. In this paper, we consider two other important tasks in the PLP setting: the Maximum-A-Posteriori (MAP) inferen…
  arxiv Elena Bellodi, Marco Alberti, Fabrizio Riguzzi, Riccardo Zese 2020-08-04T08:10:51Z 置信度 0.78 cs.AIcs.LO
• Classical Predicative Logic-Enriched Type Theories
  A logic-enriched type theory (LTT) is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named LTTO and LTTO*, which we claim correspond closely to the classical predicative systems of second order ar…
  arxiv Robin Adams, Zhaohui Luo 2009-06-09T13:44:28Z 置信度 0.78 cs.LOmath.LO
• Non-commutative linear logic fragments with sub-context-free complexity
  We present new descriptive complexity characterisations of classes REG (regular languages), LCFL (linear context-free languages) and CFL (context-free languages) as restrictions on inference rules, size of formulae and permitted connectives in the Lambek calcu…
  arxiv Yusaku Nishimiya, Masaya Taniguchi 2025-11-04T08:13:10Z 置信度 0.78 cs.LOcs.CCcs.FLmath.LO
• Monadic Second-Order Logic with Arbitrary Monadic Predicates
  We study Monadic Second-Order Logic (MSO) over finite words, extended with (non-uniform arbitrary) monadic predicates. We show that it defines a class of languages that has algebraic, automata-theoretic and machine-independent characterizations. We consider th…
  arxiv Nathanaël Fijalkow, Charles Paperman 2017-09-10T15:36:28Z 置信度 0.78 cs.LO
• Classical linear logic, cobordisms and categorical semantics of categorial grammars
  We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)} are not abstract $λ…
  arxiv Sergey Slavnov 2018-10-04T04:02:11Z 置信度 0.78 cs.LOcs.CLmath.LO
• Simple example of weak modal logic based on intuitionistic core
  In this paper we present simple example of propositional logic which has one modal operator and is based on intuitionistic core. This system is very weak in modal sense - e.g. rules of regularity or monotonicity do not hold. It has complete semantics composed …
  arxiv Tomasz Witczak 2018-06-25T13:19:41Z 置信度 0.78 math.LOcs.LO
• A Proof in Coq that Core Logic is not Paraconsistent
  Tennant claims that his Core logic $\mathbb{C}$ is paraconsistent. It means that the sequent of the First Lewis Paradox, i.e. $\lnot A, A \vdash B$ is declared false, and its corresponding antisequent, called `Claim~1', i.e. $\lnot A, A \nvdash B$ true, as in …
  arxiv Joseph Vidal-Rosset 2026-06-04T09:52:39Z 置信度 0.78 math.LOcs.LO
• Superabelian logics
  This paper presents a unified algebraic study of a family of logics related to Abelian logic (Ab), the logic of Abelian lattice-ordered groups. We treat Ab as the base system and refer to its expansions as superabelian logics. The paper focuses on two main fam…
  arxiv Petr Cintula, Filip Jankovec, Carles Noguera 2024-09-30T10:29:39Z 置信度 0.78 math.LOcs.LO
• About epistemic negation and world views in Epistemic Logic Programs
  In this paper we consider Epistemic Logic Programs, which extend Answer Set Programming (ASP) with "epistemic operators" and "epistemic negation", and a recent approach to the semantics of such programs in terms of World Views. We propose some observations on …
  arxiv Stefania Costantini 2019-07-23T13:29:10Z 置信度 0.78 cs.AIcs.LO
• Transformations of Logic Programs on Infinite Lists
  We consider an extension of logic programs, called ω-programs, that can be used to define predicates over infinite lists. ω-programs allow us to specify properties of the infinite behavior of reactive systems and, in general, properties of infinite sequences o…
  arxiv Alberto Pettorossi, Maurizio Proietti, Valerio Senni 2010-07-23T15:29:40Z 置信度 0.78 cs.PLcs.LO
• Tableaux for multi-modal hybrid logic with binders, transitive relations and relation hierarchies
  In a previous paper, a tableau calculus has been presented, which constitute a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work extends such a calculus to multi-modal logic with transitiv…
  arxiv M. Cialdea Mayer 2012-10-21T14:59:52Z 置信度 0.78 cs.LOmath.LO
• A Logic that Captures $β$P on Ordered Structures
  We extend the inflationary fixed-point logic, IFP, with a new kind of second-order quantifiers which have (poly-)logarithmic bounds. We prove that on ordered structures the new logic $\exists^{\log^ω}\text{IFP}$ captures the limited nondeterminism class $β\tex…
  arxiv Kexu Wang, Xishun Zhao 2019-12-09T04:26:59Z 置信度 0.78 cs.LOcs.CCmath.LO
• Random Logic Programs: Linear Model
  This paper proposes a model, the linear model, for randomly generating logic programs with low density of rules and investigates statistical properties of such random logic programs. It is mathematically shown that the average number of answer sets for a rando…
  arxiv Kewen Wang, Lian Wen, Kedian Mu 2014-06-23T22:23:11Z 置信度 0.78 cs.AI
• Inconsistency Robustness in Logic Programs
  Inconsistency robustness is "information system performance in the face of continually pervasive inconsistencies." A fundamental principle of Inconsistency Robustness is to make contradictions explicit so that arguments for and against propositions can be form…
  arxiv Carl Hewitt 2009-04-20T14:07:18Z 置信度 0.78 cs.LO
• Logics for Epistemic Actions: Completeness, Decidability, Expressivity
  We consider dynamic versions of epistemic logic as formulated in Baltag and Moss "Logics for epistemic programs" (2004). That paper proposed a logical language (actually families of languages parameterized by action signatures) for dynamic epistemic logic. It …
  arxiv Alexandru Baltag, Lawrence S. Moss, Slawomir Solecki 2022-03-13T19:48:20Z 置信度 0.78 cs.LOmath.LO
• Efficient Logic Gate Networks for Video Copy Detection
  Video copy detection requires robust similarity estimation under diverse visual distortions while operating at very large scale. Although deep neural networks achieve strong performance, their computational cost and descriptor size limit practical deployment i…
  arxiv Katarzyna Fojcik 2026-04-23T14:01:13Z 置信度 0.78 cs.CVcs.AIcs.IR
• Algebraic classifications for fragments of first-order logic and beyond
  Complexity and decidability of logics is a major research area involving a huge range of different logical systems. This calls for a unified and systematic approach for the field. We introduce a research program based on an algebraic approach to complexity cla…
  arxiv Reijo Jaakkola, Antti Kuusisto 2020-05-03T20:47:00Z 置信度 0.78 math.LOcs.LO
• Metric Temporal Equilibrium Logic over Timed Traces
  In temporal extensions of Answer Set Programming (ASP) based on linear-time, the behavior of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the specific times associated with each …
  arxiv Arvid Becker, Pedro Cabalar, Martín Diéguez, Torsten Schaub 等 2023-04-28T11:39:49Z 置信度 0.78 cs.AI
• Defining Logical Systems via Algebraic Constraints on Proofs
  We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof system for a target logic…
  arxiv Alexander V. Gheorghiu, David J. Pym 2023-01-05T16:06:09Z 置信度 0.78 cs.LOmath.LO
• Logic and linear algebra: an introduction
  We give an introduction to logic tailored for algebraists, explaining how proofs in linear logic can be viewed as algorithms for constructing morphisms in symmetric closed monoidal categories with additional structure. This is made explicit by showing how to r…
  arxiv Daniel Murfet 2014-07-09T22:33:31Z 置信度 0.78 math.LOcs.LOmath.CT
• Developing a Generalizable Two-Input Genetic AND Logic Gate in Arabidopsis thaliana for Multi-Signal Processing
  With effective engineering using synthetic biology approaches, plant-based platforms could conceivably be designed to minimize the production costs and wastes of high-value products such as medicines, biofuels, and chemical feedstocks that would otherwise be u…
  crossref Charles Edgar Anderson 2025-01-17T08:10:02Z 置信度 0.70
• Evolving Quantum Logic Gate Circuits in Qiskit
  The emergence of quantum computers represents a crucial leap forward in practical computability, when compared to classical architectures. Harnessing that power effectively is an exercise of increasing importance. Despite research in this field expanding rapid…
  crossref Thomas Newbold, Alberto Moraglio 2024-08-01T14:54:43Z 置信度 0.70
• logic product gate
  crossref 2011-08-01T14:20:12Z 置信度 0.70
• logic sum gate
  crossref 2011-08-01T10:20:12Z 置信度 0.70