Results 51 to 60 of about 44,054 (190)
Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers
, 2004 We show that the satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting quantifiers are both in NEXPTIME, even when counting quantifiers are coded succinctly.Comment: 24 pages, 1 pstex_t ...
Pratt-Hartmann, Ian
core +2 more sources
Ordered Navigation on Multi-attributed Data Words [PDF]
, 2014 We study temporal logics and automata on multi-attributed data words. Recently, BD-LTL was introduced as a temporal logic on data words extending LTL by navigation along positions of single data values. As allowing for navigation wrt.
Decker, Normann +3 more
core +1 more source
Finding Minimum‐Cost Explanations for Predictions Made by Tree Ensembles
Software: Practice and Experience, EarlyView.ABSTRACT The ability to reliably explain why a machine learning model arrives at a particular prediction is crucial when used as decision support by human operators of critical systems. The provided explanations must be provably correct, and preferably without redundant information, called minimal explanations.
John Törnblom +2 more
wiley +1 more source
Noûs, EarlyView.ABSTRACT It is a truism of mathematics that differences between isomorphic number systems are irrelevant to arithmetic. This truism is deeply rooted in the modern axiomatic method and underlies most strands of arithmetical structuralism, the view that arithmetic is about some abstract number structure.
Balthasar Grabmayr
wiley +1 more source
A Modal Logic for Subject-Oriented Spatial Reasoning [PDF]
, 2019 We present a modal logic for representing and reasoning about space seen from the subject\u27s perspective. The language of our logic comprises modal operators for the relations "in front", "behind", "to the left", and "to the right" of the subject ...
Walega, Przemyslaw Andrzej +1 more
core +1 more source
International Journal of Apllied Mathematics, 2016 We define a satisfiability tree in the context of classical propositional logic. Satisfiability tree is a structure inspired by the Beth’s semantic tableau, later refined into its modern variant by Lis and Smullyan and by the notion that tableau is a tree-like representation of a formula.
openaire +3 more sources
Making desires satisfied, making satisfied desires
Philosophical Studies, 2023 AbstractIn this paper, I explore a fundamental but under-appreciated distinction between two ways of understanding the desire-satisfaction theory of well-being. According to proactive desire satisfactionism, a person is benefited by the acquisition of new satisfied desires. According to reactive desire satisfactionism, a person can be benefited only by
openaire +1 more source
Is a More‐Than‐Minimal State the Meta‐Utopia?
Philosophy &Public Affairs, EarlyView.ABSTRACT Part III of Anarchy, State, and Utopia defends the minimal state as a framework for utopia. On Bader's reconstruction, this defense contains two justificatory strands: a common ground argument, which shows the minimal state to be compatible with the widest range of utopian associations, and an approximation argument, which holds it to be the ...
Carlo Ludovico Cordasco
wiley +1 more source
Model-Checking Problems as a Basis for Parameterized Intractability [PDF]
Logical Methods in Computer Science, 2005 Most parameterized complexity classes are defined in terms of a parameterized version of the Boolean satisfiability problem (the so-called weighted satisfiability problem). For example, Downey and Fellow's W-hierarchy is of this form.
Joerg Flum, Martin Grohe
doaj +1 more source
, 2014 We develop a sound, complete and practically implementable tableaux-based decision method for constructive satisfiability testing and model synthesis in the fragment ATL+ of the full Alternating time temporal logic ATL*.
A. David +7 more
core +6 more sources