Suchergebnisse - Theory of computation → Constraint and logic programming

No-Rainbow Problem and the Surjective Constraint Satisfaction Problem von Zhuk, Dmitriy

“… The Surjective Constraint Satisfaction Problem (SCSP) is the problem of deciding whether there exists a surjective assignment to a set of variables subject …”
Volltext

Lovász-Type Theorems and Game Comonads von Dawar, Anuj, Jakl, Tomas, Reggio, Luca

“… Lovász (1967) showed that two finite relational structures A and B are isomorphic if, and only if, the number of homomorphisms from C to A is the same as the …”
Volltext

Some constructive variants of S4 with the finite model property von Balbiani, Philippe, Dieguez, Martin, Fernandez-Duque, David

“… The logics CS4 and IS4 are intuitionistic variants of the modal logic S4. Whether the finite model property holds for each of these logics has been a long-standing open problem …”
Volltext

Alignment Completeness for Relational Hoare Logics von Nagasamudram, Ramana, Naumann, David A.

“… Relational Hoare logics (RHL) provide rules for reasoning about relations between programs …”
Volltext

Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments von Jung, Jean Christoph, Wolter, Frank

“… In logics with the Craig interpolation property (CIP) the existence of an interpolant for an implication follows from the validity of the implication …”
Volltext

A Quantum Interpretation of Bunched Logic & Quantum Separation Logic von Zhou, Li, Barthe, Gilles, Hsu, Justin, Ying, Mingsheng, Yu, Nengkun

“… We propose a model of the substructural logic of Bunched Implications (BI) that is suitable for reasoning about quantum states …”
Volltext

Past and present (and future) of parallel and distributed computation in (constraint) logic programming von FIORETTO, FERDINANDO, PONTELLI, ENRICO

“… The potential for transparent exploitation of parallelism in logic programming emerged almost immediately with the birth of the paradigm (Pollard 1981) …”
Volltext

Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses von Burn, Toby Cathcart, Ong, Luke, Ramsay, Steven, Wagner, Dominik

“… The class may be viewed as a generalisation to higher-order logic (with a simple restriction on types …”
Volltext

On Logics and Homomorphism Closure von Bodirsky, Manuel, Feller, Thomas, Knauer, Simon, Rudolph, Sebastian

“… Predicate logic is the premier choice for specifying classes of relational structures …”
Volltext

Categorical models of Linear Logic with fixed points of formulas von Ehrhard, Thomas, Jafarrahmani, Farzad

“… We develop a categorical semantics of µLL, a version of propositional Linear Logic with least and greatest fixed points extending David Baelde's propositional …”
Volltext

In search of lost time: Axiomatising parallel composition in process algebras von Aceto, Luca, Anastasiadi, Elli, Castiglioni, Valentina, Ingolfsdottir, Anna, Luttik, Bas

“… This survey reviews some of the most recent achievements in the saga of the axiomatisation of parallel composition, along with some classic results. We focus …”
Volltext

Towards a more efficient approach for the satisfiability of two-variable logic von Lin, Ting-Wei, Lu, Chia-Hsuan, Tan, Tony

“… We revisit the satisfiability problem for two-variable logic, denoted by SAT(FO 2 ), which is known to be NEXP-complete …”
Volltext

Compositional relational reasoning via operational game semantics von Jaber, Guilhem, Murawski, Andrzej S.

“… We show how to use operational game semantics as a guide to develop relational techniques for establishing contextual equivalences with respect to contexts …”
Volltext

Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis Implication von de Groot, Jim, Litak, Tadeusz, Pattinson, Dirk

“… of (simple type theory extended with) Haskell-style arrows, in preservativity logic of Heyting arithmetic, in the proof theory of guarded (co …”
Volltext

Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes von Dreier, Jan

“… Most notably, every problem definable in first-order logic can be solved in linear time on bounded expansion graph classes …”
Volltext

Parameterized Complexity of Elimination Distance to First-Order Logic Properties von Fomin, Fedor V., Golovach, Petr A., Thilikos, Dimitrios M.

“… We initiate the study of elimination distances to graph properties expressible in first-order logic …”
Volltext

Declarative Logic Programming: Theory, Systems, and Applications von Michael, Kifer, Liu, Yanhong

“… Logic Programming (LP) is at the nexus of knowledge representation, AI, mathematical logic, databases, and programming languages …”
Volltext

A Constructive Logic with Classical Proofs and Refutations von Barenbaum, Pablo, Freund, Teodoro

“… We study a conservative extension of classical propositional logic distinguishing between four modes of statement …”
Volltext

Accelerating All-SAT Computation with Short Blocking Clauses von Zhang, Yueling, Pu, Geguang, Sun, Jun

“… The All-SAT (All-SATisfiable) problem focuses on finding all satisfiable assignments of a given propositional formula, whose applications include model checking, automata construction, and logic minimization …”
Volltext

Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP von Barto, Libor, Brady, Zarathustra, Bulatov, Andrei, Kozik, Marcin, Zhuk, Dmitriy

“… This paper focuses on the algebraic theory underlying the study of the complexity and the algorithms for the Constraint Satisfaction Problem (CSP …”
Volltext