Results 41 to 50 of about 1,475 (68)
On SAT representations of XOR constraints [PDF]
, 2013 We study the representation of systems S of linear equations over the two-element field (aka xor- or parity-constraints) via conjunctive normal forms F (boolean clause-sets).
A. Urquhart +13 more
core +2 more sources
Schematic Cut elimination and the Ordered Pigeonhole Principle [Extended Version]
, 2016 In previous work, an attempt was made to apply the schematic CERES method [8] to a formal proof with an arbitrary number of {\Pi} 2 cuts (a recursive proof encapsulating the infinitary pigeonhole principle) [5].
Cerna, David, Leitsch, Alexander
core +1 more source
Functional units for natural numbers [PDF]
, 2009 Interaction with services provided by an execution environment forms part of the behaviours exhibited by instruction sequences under execution. Mechanisms related to the kind of interaction in question have been proposed in the setting of thread algebra.
Bergstra, J. A., Middelburg, C. A.
core +1 more source
Models of Type Theory Based on Moore Paths
, 2019 This paper introduces a new family of models of intensional Martin-L\"of type theory. We use constructive ordered algebra in toposes. Identity types in the models are given by a notion of Moore path.
Orton, Ian, Pitts, Andrew M.
core +1 more source
On Hoare-McCarthy algebras [PDF]
, 2010 We discuss an algebraic approach to propositional logic with side effects. To this end, we use Hoare's conditional [1985], which is a ternary connective comparable to if-then-else.
Bergstra, Jan A., Ponse, Alban
core +1 more source
, 2011 Four options for assigning a meaning to Islamic Logic are surveyed including a new proposal for an option named "Real Islamic Logic" (RIL). That approach to Islamic Logic should serve modern Islamic objectives in a way comparable to the functionality of ...
Bergstra, Jan Aldert
core +1 more source
Towards an Effective Decision Procedure for LTL formulas with Constraints
, 2013 This paper presents an ongoing work that is part of a more wide-ranging project whose final scope is to define a method to validate LTL formulas w.r.t.
Comini, Marco +2 more
core
Logic Programming for Describing and Solving Planning Problems
, 2000 A logic programming paradigm which expresses solutions to problems as stable models has recently been promoted as a declarative approach to solving various combinatorial and search problems, including planning problems.
Bruynooghe, Maurice
core +2 more sources
Recent results by the inconsistency-adaptive labourers. [PDF]
, 2007 Batens, Diderik, Meheus, Joke
core
Some of the next articles are maybe not open access.
Related searches:
Related searches: