A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
We call the result the sorted Datalog hammer. ... In a previous paper, we have shown that clause sets belonging to the Horn Bernays-Sch\"onfinkel fragment over simple linear real arithmetic (HBS(SLR)) can be translated into HBS clause sets over a finite ... We thank our anonymous reviewers for their constructive comments. ...arXiv:2201.09769v1 fatcat:lrsphssg7bhcho526zln3qaotq
For the Horn case, we provide a Datalog hammer preserving validity and satisfiability. ... The Bernays-Sch\"onfinkel first-order logic fragment over simple linear real arithmetic constraints BS(SLR) is known to be decidable. ... We thank Pascal Fontaine, Alberto Griggio, Andrew Reynolds, Stephan Schulz and our anonymous reviewers for discussing various aspects of this paper. ...arXiv:2107.03189v1 fatcat:pyucttaazze5hksahib5zksfli
Our main results are conditions that imply an abstraction is sound, and further conditions that imply it preserves the Markov property. ... We formalize agent-based models as stochastic processes whose states are metafinite models, and we define a notion of abstraction. ... Many problems in computer science (e.g. in program verification) can be reduced to checking satisfiability of ground formulae w.r.t. a theory which can be a standard theory (for instance linear arithmetic ...fatcat:7srdlw7mxfhrpiwdxshf2n455y