340 Hits in 4.7 sec

An Isomorph-Free SEM-Like Enumeration of Models

Thierry Boy de la Tour, Prakash Countcham
2005 Electronical Notes in Theoretical Computer Science  
We investigate the integration of the enumeration of finite models of a formula, including unit propagation and pruning mechanisms, as provided by the system SEM, into McKay's general method of isomorph-free  ...  exhaustive enumeration.  ...  Hence it should be possible, by restricting SEMK, to obtain an isomorph-free enumeration of P.  ... 
doi:10.1016/j.entcs.2005.01.003 fatcat:2nd4s2bvvjfmxozkqzxzxyiesy

Page 5137 of Mathematical Reviews Vol. , Issue 97H [page]

1997 Mathematical Reviews  
(Isomorphic labeled posets are identified.)  ...  However, once the base of representation is fixed, these models are all equivalent. “This article is divided into two parts. Standard bases like base 10 are first considered.  ... 

Comparing Approaches to the Exploration of the Domain of Residue Classes

Andreas Meier, Martin Pollet, Volker Sorge
2002 Journal of symbolic computation  
In particular, we experimented with substituting computer algebra by model generation and by proving theorems with a first-order equational theorem prover instead of a proof planner.  ...  We construct proofs for basic algebraic properties of residue classes as well as for isomorphisms between residue classes using different proof techniques, which are implemented as strategies in a multi-strategy  ...  Acknowledgements We would like to thank Thomas Hillenbrandt for his help on the use of WaldMeister and Hans deNeville for stimulating discussions.  ... 
doi:10.1006/jsco.2002.0550 fatcat:cgnob5nyqbbarouqot5cgy24pe

Expressive Completeness of Existential Rule Languages for Ontology-based Query Answering [article]

Heng Zhang, Yan Zhang, Jia-Huai You
2016 arXiv   pre-print
We also show that neither the class of disjunctive tuple-generating dependencies nor the class of embedded dependencies is expressively complete for recursively enumerable OCQA ontologies.  ...  In this paper, we prove that disjunctive embedded dependencies exactly capture the class of recursively enumerable ontologies in Ontology-based Conjunctive Query Answering (OCQA).  ...  Vardi for kindly pointing out an important related work.  ... 
arXiv:1604.05006v2 fatcat:3huyh4v4vvc3zlnkicr2zknzqy

Structured algebraic specifications: A Kernel language

Martin Wirsing
1986 Theoretical Computer Science  
It is shown that any recursively enumerable signature and any class of algebras which is 'pseudo-axiomatizable' in a recursively enumerable way are definable in ASL; also, every computable transformation  ...  The presentation semantics is used for showing the existence of a complete (semiformal) proof system for specifications, whereas the model class semantics is fully abstract with respect to specification  ...  I would like to express my gratitude to the directors of this project Friedrich L.  ... 
doi:10.1016/0304-3975(86)90051-4 fatcat:kowsnd4ngfhelfoxxr7nn5l6za

Algebraic translations, correctness and algebraic compiler construction

Theo M.V. Janssen
1998 Theoretical Computer Science  
Algebraic translation methods are argued for in many fields of science.  ...  Special attention will be given to the notion 'correctness of translation'.  ...  Acknowledgements I thank the following persons for their useful remarks or assistance during the preparation of this article: Mark van de Brand, Peter van Emde Boas, Dick Grune, Lex Hendrix, Dick de Jongh  ... 
doi:10.1016/s0304-3975(97)00267-3 fatcat:7rnbt4zlwrajvbad4o6amfhfya

A Strictly NSOP_3 Theory [article]

Massoud Pourmahdian, Ali N. Valizadeh
2021 arXiv   pre-print
The existence of such a theory provides a better understanding of the hierarchy of unstable theories without the strict order property.  ...  We define the new notion of a μ-uniformly-counter-collapsed structure using which we introduce a theory 𝕋_μ serving as the first example of a strictly NSOP_3 theory.  ...  (i) A model N |= T ∞ µ containing an isomorphic copy of B, sayb, is said to omit C overb if N |= ¬∃z Diag C (b;z).  ... 
arXiv:2011.04034v2 fatcat:kqqu7jrtwzczbe7ng3kfwzsbvq

Identification of structures for ion channel kinetic models

Kathryn E. Mangold, Wei Wang, Eric K. Johnson, Druv Bhagavan, Jonathan D. Moreno, Jeanne M. Nerbonne, Jonathan R. Silva, Jeffrey J. Saucerman
2021 PLoS Computational Biology  
of acceptable models.  ...  Past studies have examined limited sets of various topologies for Markov models of channel dynamics.  ...  Acknowledgments The authors would like to acknowledge Michael Southworth for programming guidance. Author Contributions Conceptualization: Kathryn E. Mangold, Jonathan R. Silva.  ... 
doi:10.1371/journal.pcbi.1008932 pmid:34398881 pmcid:PMC8389848 fatcat:ileemr7v55hjtkaio34ko6ucre

On church's formal theory of functions and functionals

Giuseppe Longo
1988 Annals of Pure and Applied Logic  
Several people read an earlier version of this paper and suggested corrections and changes; these include Pierre Louis Curien, Pino Rosolini, Eugenio Moggi, Roger Hindley, Dieter Spreen, Kim Bruce.  ...  In particular, he tought and keeps teaching me most of what I know on the categorical approach to life (and to the foundation of Mathematics).  ...  is like quantifying over sets of a given type.  ... 
doi:10.1016/0168-0072(88)90017-6 fatcat:wennxgfhp5avrjzsl7qufrcmvm

How to identify, translate and combine logics?

Florian Rabe
2014 Journal of Logic and Computation  
We apply this to give general definitions for equivalence of logics, translation between logics, and combination of logics.  ...  We also establish general criteria for the soundness and completeness of these.  ...  We would like to use m(−) like a functor that maps extensions of A to extensions of B. However, in general, the functoriality laws only hold up to isomorphism.  ... 
doi:10.1093/logcom/exu079 fatcat:nhndkvmuzvfdzpswiozpytxbra

Simple generic structures

Massoud Pourmahdian
2003 Annals of Pure and Applied Logic  
Here TNat and the class of existentially closed models of (TNat) ∀ =T+; EX (T+), play an important role in description of the theory of the K0; ≺ -generic.  ...  We introduce the notion of semigenericity and show that if a K0; ≺ -semigeneric structure exists then EX (T+) is an elementary class and therefore the L-theory of K0; ≺ -generic is near model complete.  ...  Acknowledgements We would like to thank J. Baldwin, D. Evans, F. Wagner and the referee for their useful and constructive comments.  ... 
doi:10.1016/s0168-0072(02)00114-8 fatcat:cg3v4yigyja6xoquhjfghpnuam

Concurrency and atomicity

G. Boudol, I. Castellani
1988 Theoretical Computer Science  
But our point is that at each step the performed action is a compound one, namely a labelled yoset, not just an atom.  ...  As in the usual semantics of sequential programs, a process operates on data by means of its terminated sequences of computations.  ...  However MEIJ~ does not provide an adequate model for causality since we have something like (ab)c) = a(b)c)+(alc)b.  ... 
doi:10.1016/0304-3975(88)90096-5 fatcat:iv3igywltvcgnjaj7pt7dvapxa

Some Model Theoretic Properties of Non-AC Generic Structures [article]

Ali N. Valizadeh, Massoud Pourmahdian
2016 arXiv   pre-print
In the context of Hrushovski constructions we take a language L with a ternary relation R and consider the theory of the generic models M^*_α, of the class of finite L-structures equipped with predimension  ...  ^*_α) does not have the finite model property.  ...  We would like to thank Zaniar Ghadernezhad for some helpful discussions. Also we would like to thank Mohsen Khani for carefully reading the paper and giving useful comments and suggestions.  ... 
arXiv:1606.05750v1 fatcat:nmblbrl5zfcmbncd5by63y4n4e

Algebraic Equivalence of Linear Structural Equation Models [article]

Thijs van Ommen, Joris M. Mooij
2018 arXiv   pre-print
For causal discovery, two of these problems are especially important: the enumeration of the constraints imposed by a model, and deciding whether two graphs define the same statistical model.  ...  We show how the half-trek criterion can be used to make progress in both of these problems.  ...  The authors would like to thank Patrick Forré, Tom Claassen and the anonymous reviewers for their valuable comments.  ... 
arXiv:1807.03527v1 fatcat:hrxeia4snvesbfxgrwhwgcq2ga

Page 8600 of Mathematical Reviews Vol. , Issue 2001M [page]

2001 Mathematical Reviews  
model).  ...  In this paper, five fundamental measures of the extent of non- planarity of graphs are discussed from an algorithmic perspective.  ... 
« Previous Showing results 1 — 15 out of 340 results