Related papers: Encoding Argumentation Frameworks to Propositional Logic Systems

Related papers

Dynamic Large Concept Models: Latent Reasoning in an Adaptive Semantic Space [56.37266873329401]
Large Language Models (LLMs) apply uniform computation to all tokens, despite language exhibiting highly non-uniform information density.<n>We propose $textbfDynamic Large Concept Models (DLCM)$, a hierarchical language modeling framework that learns semantic boundaries from latent representations and shifts from tokens to a compressed concept space where reasoning is more efficient.
arXiv Detail & Related papers (2025-12-31T04:19:33Z)
Transversal Gates in Nonadditive Quantum Codes [3.980076328494117]
We search codes with specified groups by parametrizing logical subspaces on the Stiefel manifold.<n>Applying this method, we uncover a new $((6,2,3))$ code admitting a $Zbigl(tfrac2pi5bigr)$ gate.<n>Several new $(7,2,3))$ codes realize the binary icosahedral group $2I$.
arXiv Detail & Related papers (2025-04-29T15:18:33Z)
Logic-Based Artificial Intelligence Algorithms Supporting Categorical Semantics [0.0]
We develop forward chaining and normal form algorithms for reasoning about objects in cartesian categories with the rules for Horn logic. We also adapt first-order unification to support multi-sorted theories, contexts, and fragments of first-order logic.
arXiv Detail & Related papers (2025-04-27T18:02:02Z)
Clifford gates with logical transversality for self-dual CSS codes [0.8009842832476994]
Quantum error-correcting codes with high encoding rate are good candidates for large-scale quantum computers.<n>Some logical gates of a high-rate code can be fault-tolerantly implemented using physical gates.<n>We show that certain logical Clifford gates have multiple implementations, each by logical gates at a different level of concatenation.
arXiv Detail & Related papers (2025-03-25T15:55:12Z)
A Semantic Parsing Algorithm to Solve Linear Ordering Problems [2.23890712706409]
We develop an algorithm to semantically parse linear ordering problems. Our method takes as input a number of premises and candidate statements. We then utilize constraint logic programming to infer the truth of proposed statements about the ordering.
arXiv Detail & Related papers (2025-02-12T13:58:42Z)
Aristotle: Mastering Logical Reasoning with A Logic-Complete Decompose-Search-Resolve Framework [93.59256448185954]
We propose a logic-complete reasoning framework, Aristotle, with three key components: Logical Decomposer, Logical Search Router, and Logical Resolver.<n>In our framework, symbolic expressions and logical rules are comprehensively integrated into the entire reasoning process.<n>The experimental results on several datasets demonstrate that Aristotle consistently outperforms state-of-the-art reasoning frameworks in both accuracy and efficiency.
arXiv Detail & Related papers (2024-12-22T10:14:09Z)
Model-agnostic basis functions for the 2-point correlation function of dark matter in linear theory [0.0]
We find a basis $mathcalB$ that describes $xi_rm lin(r)$ near the baryon acoustic oscillation feature in a wide class of cosmological models.<n>Using our basis functions in model-agnostic BAO analyses can potentially lead to significant statistical gains.
arXiv Detail & Related papers (2024-10-28T18:00:01Z)
Block Circulant Codes with Application to Decentralized Systems [12.014314088945968]
We develop a family of $[n,k,d]$ block circulant codes that support distributed erasure decoding.<n>The code is ideal for use in protocols that address the data availability problem in blockchain networks.
arXiv Detail & Related papers (2024-06-18T00:22:20Z)
A shortcut to an optimal quantum linear system solver [55.2480439325792]
We give a conceptually simple quantum linear system solvers (QLSS) that does not use complex or difficult-to-analyze techniques. If the solution norm $lVertboldsymbolxrVert$ is known exactly, our QLSS requires only a single application of kernel. Alternatively, by reintroducing a concept from the adiabatic path-following technique, we show that $O(kappa)$ complexity can be achieved for norm estimation.
arXiv Detail & Related papers (2024-06-17T20:54:11Z)
Parameterized Dynamic Logic -- Towards A Cyclic Logical Framework for General Program Specification and Verification [0.174048653626208]
We present a theory of parameterized dynamic logic, namely DLp, for specifying and reasoning about a rich set of program models.<n>It provides a flexible verification framework based on the theories of dynamic logics.
arXiv Detail & Related papers (2024-04-28T07:08:44Z)
LINC: A Neurosymbolic Approach for Logical Reasoning by Combining Language Models with First-Order Logic Provers [60.009969929857704]
Logical reasoning is an important task for artificial intelligence with potential impacts on science, mathematics, and society. In this work, we reformulating such tasks as modular neurosymbolic programming, which we call LINC. We observe significant performance gains on FOLIO and a balanced subset of ProofWriter for three different models in nearly all experimental conditions we evaluate.
arXiv Detail & Related papers (2023-10-23T17:58:40Z)
LOGICSEG: Parsing Visual Semantics with Neural Logic Learning and Reasoning [73.98142349171552]
LOGICSEG is a holistic visual semantic that integrates neural inductive learning and logic reasoning with both rich data and symbolic knowledge. During fuzzy logic-based continuous relaxation, logical formulae are grounded onto data and neural computational graphs, hence enabling logic-induced network training. These designs together make LOGICSEG a general and compact neural-logic machine that is readily integrated into existing segmentation models.
arXiv Detail & Related papers (2023-09-24T05:43:19Z)
Matching upper bounds on symmetric predicates in quantum communication complexity [0.0]
We focus on the quantum communication complexity of functions of the form $f circ G = f(G)mathrmQCC_mathrmE(G)) when the parties are allowed to use shared entanglement. We show that the same statement holds emphwithout shared entanglement, which generalizes their result.
arXiv Detail & Related papers (2023-01-01T08:30:35Z)
Discourse-Aware Graph Networks for Textual Logical Reasoning [142.0097357999134]
Passage-level logical relations represent entailment or contradiction between propositional units (e.g., a concluding sentence) We propose logic structural-constraint modeling to solve the logical reasoning QA and introduce discourse-aware graph networks (DAGNs) The networks first construct logic graphs leveraging in-line discourse connectives and generic logic theories, then learn logic representations by end-to-end evolving the logic relations with an edge-reasoning mechanism and updating the graph features.
arXiv Detail & Related papers (2022-07-04T14:38:49Z)
Neuro-Symbolic Inductive Logic Programming with Logical Neural Networks [65.23508422635862]
We propose learning rules with the recently proposed logical neural networks (LNN) Compared to others, LNNs offer strong connection to classical Boolean logic. Our experiments on standard benchmarking tasks confirm that LNN rules are highly interpretable.
arXiv Detail & Related papers (2021-12-06T19:38:30Z)
A Logic-Based Framework for Natural Language Inference in Dutch [1.0178220223515955]
We present a framework for deriving relations between Dutch sentence pairs. The proposed framework relies on logic-based reasoning to produce inspectable proofs leading up to inference labels. We evaluate the reasoning pipeline on the recently created Dutch natural language inference dataset.
arXiv Detail & Related papers (2021-10-07T10:34:46Z)
Refining Labelled Systems for Modal and Constructive Logics with Applications [0.0]
This thesis serves as a means of transforming the semantics of a modal and/or constructive logic into an 'economical' proof system. The refinement method connects two proof-theoretic paradigms: labelled and nested sequent calculi. The introduced refined labelled calculi will be used to provide the first proof-search algorithms for deontic STIT logics.
arXiv Detail & Related papers (2021-07-30T08:27:15Z)
Logic-Driven Context Extension and Data Augmentation for Logical Reasoning of Text [65.24325614642223]
We propose to understand logical symbols and expressions in the text to arrive at the answer. Based on such logical information, we put forward a context extension framework and a data augmentation algorithm. Our method achieves the state-of-the-art performance, and both logic-driven context extension framework and data augmentation algorithm can help improve the accuracy.
arXiv Detail & Related papers (2021-05-08T10:09:36Z)
Lexicographic Logic: a Many-valued Logic for Preference Representation [1.5484595752241122]
We propose lexicographic logic, an extension of classical propositional logic that can express a variety of preferences. We argue that the new logic is an effective formalism for ranking query results according to the satisfaction level of user preferences.
arXiv Detail & Related papers (2020-12-20T14:42:04Z)
An Optimal Separation of Randomized and Quantum Query Complexity [67.19751155411075]
We prove that for every decision tree, the absolute values of the Fourier coefficients of a given order $ellsqrtbinomdell (1+log n)ell-1,$ sum to at most $cellsqrtbinomdell (1+log n)ell-1,$ where $n$ is the number of variables, $d$ is the tree depth, and $c>0$ is an absolute constant.
arXiv Detail & Related papers (2020-08-24T06:50:57Z)
On the Modularity of Hypernetworks [103.1147622394852]
We show that for a structured target function, the overall number of trainable parameters in a hypernetwork is smaller by orders of magnitude than the number of trainable parameters of a standard neural network and an embedding method.
arXiv Detail & Related papers (2020-02-23T22:51:52Z)
Agnostic Q-learning with Function Approximation in Deterministic Systems: Tight Bounds on Approximation Error and Sample Complexity [94.37110094442136]
We study the problem of agnostic $Q$-learning with function approximation in deterministic systems. We show that if $delta = Oleft(rho/sqrtdim_Eright)$, then one can find the optimal policy using $Oleft(dim_Eright)$.
arXiv Detail & Related papers (2020-02-17T18:41:49Z)
Fixed-Support Wasserstein Barycenters: Computational Hardness and Fast Algorithm [100.11971836788437]
We study the fixed-support Wasserstein barycenter problem (FS-WBP) We develop a provably fast textitdeterministic variant of the celebrated iterative Bregman projection (IBP) algorithm, named textscFastIBP.
arXiv Detail & Related papers (2020-02-12T03:40:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.