Zobrazeno 1 - 10
of 38 099
pro vyhledávání: '"Logic in computer science"'
Autor:
Cerna, David M.
Anti-unification is a fundamental operation used for inductive inference. It is abstractly defined as a process deriving from a set of symbolic expressions a new symbolic expression possessing certain commonalities shared between its members. We cons
Externí odkaz:
http://arxiv.org/abs/2412.10307
Hardware accelerators like quantum annealers or neuromorphic chips are capable of finding the ground state of a Hamiltonian. A promising route in utilizing these devices is via methods from automated reasoning: The problem at hand is first encoded in
Externí odkaz:
http://arxiv.org/abs/2412.10289
Answer Set Programming (ASP), a well-known declarative logic programming paradigm, has recently found practical application in Process Mining. In particular, ASP has been used to model tasks involving declarative specifications of business processes.
Externí odkaz:
http://arxiv.org/abs/2412.10152
Congruence closure on ground equations is a well-established, efficient algorithm for deciding ground equalities. It computes an explicit representation of the ground equivalence classes on the basis of a set of ground input equations. Then equalitie
Externí odkaz:
http://arxiv.org/abs/2412.10066
Autor:
Thapen, Neil
Subclasses of TFNP (total functional NP) are usually defined by specifying a complete problem, which is necessarily in TFNP, and including all problems many-one reducible to it. We study two notions of how a TFNP problem can be reducible to an object
Externí odkaz:
http://arxiv.org/abs/2412.09984
Autor:
Ying, Mingsheng
In this paper, we present a Hoare-style logic for reasoning about quantum programs with classical variables. Our approach offers several improvements over previous work: (1) Enhanced expressivity of the programming language: Our logic applies to quan
Externí odkaz:
http://arxiv.org/abs/2412.09869
The rise of digital platforms has led to an increasing reliance on technology-driven, home-based healthcare solutions, enabling individuals to monitor their health and share information with healthcare professionals as needed. However, creating an ef
Externí odkaz:
http://arxiv.org/abs/2412.09223
Quantum computation leverages the use of quantumly-controlled conditionals in order to achieve computational advantage. However, since the different branches in the conditional may operate on the same qubits, a typical approach to compilation involve
Externí odkaz:
http://arxiv.org/abs/2412.09153
Autor:
Tsamoura, Efthymia, Motik, Boris
Query answering over data with dependencies plays a central role in most applications of dependencies. The problem is commonly solved by using a suitable variant of the chase algorithm to compute a universal model of the dependencies and the data and
Externí odkaz:
http://arxiv.org/abs/2412.09125
Over the past two decades, the Web Ontology Language (OWL) has been instrumental in advancing the development of ontologies and knowledge graphs, providing a structured framework that enhances the semantic integration of data. However, the reliabilit
Externí odkaz:
http://arxiv.org/abs/2412.08739