Results 21 to 30 of about 1,420,577 (310)
Complexity classifications for different equivalence and audit problems for Boolean circuits [PDF]
Logical Methods in Computer Science, 2012 We study Boolean circuits as a representation of Boolean functions and consider different equivalence, audit, and enumeration problems. For a number of restricted sets of gate types (bases) we obtain efficient algorithms, while for all other gate types ...
Elmar Böhler +5 more
doaj +1 more source
Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds [PDF]
Logical Methods in Computer Science, 2012 Path checking, the special case of the model checking problem where the model under consideration is a single path, plays an important role in monitoring, testing, and verification. We prove that for linear-time temporal logic (LTL), path checking can be
Lars Kuhtz, Bernd Finkbeiner
doaj +1 more source
International Journal of Learning, Teaching and Educational Research, 2021 The paper was a pilot study that examined learning approaches of architecture students; variability of approaches by university type and gender and; influence of architecture students’ learning approaches on their academic performance. The sample was 349
Gabriel Sen, A. Adeboye, O. Alagbe
semanticscholar +1 more source
The complexity of linear-time temporal logic over the class of ordinals [PDF]
Logical Methods in Computer Science, 2010 We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theorem.
Stephane Demri, Alexander Rabinovich
doaj +1 more source
Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generator [PDF]
Logical Methods in Computer Science, 2012 For an NP intersect coNP function g of the Nisan-Wigderson type and a string b outside its range we consider a two player game on a common input a to the function.
Jan Krajíček
doaj +1 more source
Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem [PDF]
Logical Methods in Computer Science, 2012 The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymorphisms associated to the template lies in a Taylor variety, and is NP-complete otherwise ...
Libor Barto, Marcin Kozik
doaj +1 more source
The complexity of global cardinality constraints [PDF]
Logical Methods in Computer Science, 2010 In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an additional requirement that prescribes how many variables must be assigned a ...
Andrei A. Bulatov, Daniel Marx
doaj +1 more source
A Study of $k$-dipath Colourings of Oriented Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We examine $t$-colourings of oriented graphs in which, for a fixed integer $k \geq 1$, vertices joined by a directed path of length at most $k$ must be assigned different colours. A homomorphism model that extends the ideas of Sherk for the case $k=2$ is
Christopher Duffy +2 more
doaj +1 more source
Some theorems on passing from local to global presence of properties of functions [PDF]
Logical Methods in Computer Science, 2017 When given a class of functions and a finite collection of sets, one might be interested whether the class in question contains any function whose domain is a subset of the union of the sets of the given collection and whose restrictions to all of them ...
Dimiter Skordev
doaj +1 more source
The Complexity of Combinations of Qualitative Constraint Satisfaction Problems [PDF]
Logical Methods in Computer Science, 2020 The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.
Manuel Bodirsky, Johannes Greiner
doaj +1 more source