Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Bromberger, Martin"'
We show that SCL(FOL) can simulate the derivation of non-redundant clauses by superposition for first-order logic without equality. Superposition-based reasoning is performed with respect to a fixed reduction ordering. The completeness proof of super
Externí odkaz:
http://arxiv.org/abs/2305.12926
Clause sets saturated by hierarchic ordered resolution do not offer a model representation that can be effectively queried, in general. They only offer the guarantee of the existence of a model. We present an effective symbolic model construction for
Externí odkaz:
http://arxiv.org/abs/2305.05064
This paper presents an up-to-date and refined version of the SCL calculus for first-order logic without equality. The refinement mainly consists of the following two parts: First, we incorporate a stronger notion of regularity into SCL(FOL). Our regu
Externí odkaz:
http://arxiv.org/abs/2302.05954
Autor:
Bromberger, Martin, Dragoste, Irina, Faqeh, Rasha, Fetzer, Christof, González, Larry, Krötzsch, Markus, Marx, Maximilian, Murali, Harish K, Weidenbach, Christoph
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 set of first-order constants. The translation
Externí odkaz:
http://arxiv.org/abs/2201.09769
Autor:
Bromberger, Martin, Dragoste, Irina, Faqeh, Rasha, Fetzer, Christof, Krötzsch, Markus, Weidenbach, Christoph
The Bernays-Sch\"onfinkel first-order logic fragment over simple linear real arithmetic constraints BS(SLR) is known to be decidable. We prove that BS(SLR) clause sets with both universally and existentially quantified verification conditions (conjec
Externí odkaz:
http://arxiv.org/abs/2107.03189
We lift the SCL calculus for first-order logic without equality to the SCL(T) calculus for first-order logic without equality modulo a background theory. In a nutshell, the SCL(T) calculus describes a new way to guide hierarchic resolution inferences
Externí odkaz:
http://arxiv.org/abs/2003.04627
Autor:
Bromberger, Martin
We present a combination of the Mixed-Echelon-Hermite transformation and the Double-Bounded Reduction for systems of linear mixed arithmetic that preserve satisfiability and can be computed in polynomial time. Together, the two transformations turn a
Externí odkaz:
http://arxiv.org/abs/1804.07703
We consider feasibility of linear integer programs in the context of verification systems such as SMT solvers or theorem provers. Although satisfiability of linear integer programs is decidable, many state-of-the-art solvers neglect termination in fa
Externí odkaz:
http://arxiv.org/abs/1503.02948
Publikováno v:
In Journal of Symbolic Computation September-October 2020 100:102-136
Clause sets saturated by hierarchic superposition do not offer an explicit model representation, rather the guarantee that all non-redundant inferences have been performed without deriving a contradiction. We present an approach to explicit model con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::03bf6643cf9d492cb46d8d5f659a771a