Search results for "Counterexample"

showing 8 items of 48 documents

Algebraic aspects and coherence conditions for conjoined and disjoined conditionals

2019

We deepen the study of conjoined and disjoined conditional events in the setting of coherence. These objects, differently from other approaches, are defined in the framework of conditional random quantities. We show that some well known properties, valid in the case of unconditional events, still hold in our approach to logical operations among conditional events. In particular we prove a decomposition formula and a related additive property. Then, we introduce the set of conditional constituents generated by $n$ conditional events and we show that they satisfy the basic properties valid in the case of unconditional events. We obtain a generalized inclusion-exclusion formula and we prove a …

Pure mathematicsProperty (philosophy)Settore MAT/06 - Probabilita' E Statistica MatematicaDistributivityApplied MathematicsProbability (math.PR)02 engineering and technologyCoherence (statistics)Characterization (mathematics)Settore MAT/01 - Logica Matematica60Axx 03B48Theoretical Computer ScienceCoherenceConditional random quantities Conjunction and disjunction of conditionals Decomposition formula Conditional constituents Inclusion-exclusion formulaSet (abstract data type)Artificial Intelligence020204 information systemsFOS: Mathematics0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingInclusion–exclusion principleAlgebraic numberMathematics - ProbabilitySoftwareCounterexampleMathematics
researchProduct

A primal-dual algorithm for the fermat-weber problem involving mixed gauges

1987

We give a new algorithm for solving the Fermat-Weber location problem involving mixed gauges. This algorithm, which is derived from the partial inverse method developed by J.E. Spingarn, simultaneously generates two sequences globally converging to a primal and a dual solution respectively. In addition, the updating formulae are very simple; a stopping rule can be defined though the method is not dual feasible and the entire set of optimal locations can be obtained from the dual solution by making use of optimality conditions. When polyhedral gauges are used, we show that the algorithm terminates in a finite number of steps, provided that the set of optimal locations has nonepty interior an…

Set (abstract data type)Fermat's Last TheoremMathematical optimizationSimple (abstract algebra)General MathematicsNumerical analysisApplied mathematicsWeber problemFinite setSoftwareCounterexampleDual (category theory)MathematicsMathematical Programming
researchProduct

Automatic variable selection for exposure-driven propensity score matching with unmeasured confounders.

2020

Multivariable model building for propensity score modeling approaches is challenging. A common propensity score approach is exposure-driven propensity score matching, where the best model selection strategy is still unclear. In particular, the situation may require variable selection, while it is still unclear if variables included in the propensity score should be associated with the exposure and the outcome, with either the exposure or the outcome, with at least the exposure or with at least the outcome. Unmeasured confounders, complex correlation structures, and non-normal covariate distributions further complicate matters. We consider the performance of different modeling strategies in …

Statistics and ProbabilityBiometryModels StatisticalComputer scienceModel selectionFeature selectionGeneral MedicineVariance (accounting)01 natural sciencesOutcome (game theory)Correlation010104 statistics & probability03 medical and health sciencesAutomation0302 clinical medicineCovariatePropensity score matchingStatisticsMultivariate Analysis030212 general & internal medicine0101 mathematicsStatistics Probability and UncertaintyPropensity ScoreCounterexampleBiometrical journal. Biometrische ZeitschriftREFERENCES
researchProduct

Frankfurtian Reflections: A Critical Discussion of Robert Lockie’s “Three Recent Frankfurt Cases”

2016

In a recent article, Robert Lockie brings about a critical examination of three Frankfurtstyle cases designed by David Widerker and Derk Pereboom. His conclusion is that these cases do not refute either the Principle of Alternative Possibilities (PAP) or some cognate leeway principle for moral responsibility. Though I take the conclusion to be true, I contend that Lockie's arguments do not succeed in showing it. I concentrate on Pereboom's Tax Evasion 2 . After presenting Pereboom's example and analyzing its structure, I distinguish two strategies of Lockie's to defend PAP against it, which I call 'No True Alternative Decision' (NTAD) and 'No Responsibility' (NR), respectively. According to…

Structure (mathematical logic)Philosophy of mindPhilosophy of sciencePhilosophy05 social sciences06 humanities and the arts0603 philosophy ethics and religion050105 experimental psychologyCritical discussionEpistemologyPhilosophy of languagePhilosophy060302 philosophy0501 psychology and cognitive sciencesMoral responsibilityFrankfurt casesConsciència (Moral)CounterexampleLaw and economicsPhilosophia
researchProduct

Verification of linear hybrid systems with large discrete state spaces using counterexample-guided abstraction refinement

2017

Abstract We present a counterexample-guided abstraction refinement ( CEGAR) approach for the verification of safety properties of linear hybrid automata with large discrete state spaces, such as naturally arising when incorporating health state monitoring and degradation levels into the controller design. Such models can – in contrast to purely functional controller models – not be analyzed with hybrid verification engines relying on explicit representations of modes, but require fully symbolic representations for both the continuous and discrete part of the state space. The presented abstraction methods directly work on a symbolic representation of arbitrary non-convex combinations of line…

Theoretical computer scienceComputer science020207 software engineering02 engineering and technologyAutomatonHybrid system0202 electrical engineering electronic engineering information engineeringState space020201 artificial intelligence & image processingState (computer science)Representation (mathematics)Boolean data typeSoftwareInterpolationCounterexampleScience of Computer Programming
researchProduct

An Agents and Artifacts Approach to Distributed Data Mining

2013

This paper proposes a novel Distributed Data Mining (DDM) approach based on the Agents and Artifacts paradigm, as implemented in CArtAgO [9], where artifacts encapsulate data mining tools, inherited from Weka, that agents can use while engaged in collaborative, distributed learning processes. Target hypothesis are currently constrained to decision trees built with J48, but the approach is flexible enough to allow different kinds of learning models. The twofold contribution of this work includes: i) JaCA-DDM: an extensible tool implemented in the agent oriented programming language Jason [2] and CArtAgO [10,9] to experiment DDM agent-based approaches on different, well known training sets. A…

business.industryComputer scienceMulti-agent systemDecision treeCollaborative learningcomputer.software_genreMachine learningC4.5 algorithmData miningArtificial intelligencebusinesscomputerProtocol (object-oriented programming)Agent-oriented programmingCounterexample
researchProduct

4-Manifold topology II: Dwyer's filtration and surgery kernels

1995

Even when the fundamental group is intractable (i.e. not "good") many interesting 4-dimensional surgery problems have topological solutions. We unify and extend the known examples and show how they compare to the (presumed) counterexamples by reference to Dwyer's filtration on second homology. The development brings together many basic results on the nilpotent theory of links. As a special case, a class of links only slightly smaller than "homotopically trivial links" is shown to have (free) slices on their Whitehead doubles.

medicine.medical_specialtyFundamental groupGeneral MathematicsCobordismHomology (mathematics)TopologyMathematics::Geometric TopologyMathematics::Algebraic TopologySurgery4-manifoldNilpotentMathematics::K-Theory and HomologymedicineSpecial caseMathematicsCounterexampleInventiones Mathematicae
researchProduct

Carleson's counterexample and a scale of Lorentz-BMO spaces on the bitorus

2005

We introduce a full scale of Lorentz-BMO spaces BMO L p,q on the bidisk, and show that these spaces do not coincide for different values ofp andq. Our main tool is a detailed analysis of Carleson's construction in [C].

symbols.namesakeScale (ratio)General MathematicsLorentz transformationMathematical analysisFull scalesymbolsMathematicsCounterexample
researchProduct