Stem monoton$ (all stems)

154 papers:

CASE-2015-ZonEHJVSB #detection #multi #realtime #using

Real-time collision detection for multiple packaging robots using monotonicity of configuration subspaces (RvZ, DE, DH, IJ, RV, RIS, KB), pp. 1638–1643.

ESOP-2015-SiekVCTG #performance #type system

Monotonic References for Efficient Gradual Typing (JGS, MMV, MC, STH, RG), pp. 432–456.

STOC-2015-ChenDST #adaptation #query #testing

Boolean Function Monotonicity Testing Requires (Almost) n 1/2 Non-adaptive Queries (XC, AD, RAS, LYT), pp. 519–528.

CIAA-2015-Szykula #automaton

Checking Whether an Automaton Is Monotonic Is NP-complete (MS), pp. 279–291.

ICALP-v1-2015-Canonne #big data #testing

Big Data on the Rise? — Testing Monotonicity of Distributions (CLC), pp. 294–305.

SAC-2015-BouaskerY #anti #constraints #correlation #mining

Key correlation mining by simultaneous monotone and anti-monotone constraints checking (SB, SBY), pp. 851–856.

ICLP-J-2015-AlvianoFG #programming #recursion #set

Rewriting recursive aggregates in answer set programming: back to monotonicity (MA, WF, MG), pp. 559–573.

PODS-2014-AmelootKNZ #declarative #fine-grained #network

Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the calm-conjecture (TJA, BK, FN, DZ), pp. 64–75.

AFL-2014-CarapelleFGQ13 #game studies #word

Ehrenfeucht-Fraisse Games for TPTL and MTL over Non-monotonic Data Words (CC, SF, OFG, KQ), pp. 174–187.

ICALP-v1-2014-BlaisHST #approximate #on the

On DNF Approximators for Monotone Boolean Functions (EB, JH, RAS, LYT), pp. 235–246.

LATA-2014-CarapelleFGQ #satisfiability #word

Satisfiability for MTL and TPTL over Non-monotonic Data Words (CC, SF, OFG, KQ), pp. 248–259.

DHM-2014-NishimuraTGEK #performance

Effect of Wall Material of a Room on Performance in Long Monotonous Work (HN, YT, AG, AE, NK), pp. 282–291.

KR-2014-CabalarD #equivalence

Strong Equivalence of Non-Monotonic Temporal Theories (PC, MD).

LICS-CSL-2014-Das #on the

On the pigeonhole and related principles in deep inference and monotone systems (AD), p. 10.

RTA-TLCA-2014-SternagelT #algebra #certification #complexity #formal method #proving #termination

Formalizing Monotone Algebras for Certification of Termination and Complexity Proofs (CS, RT), pp. 441–455.

PODS-2013-Gottlob #identification #polynomial

Deciding monotone duality and identifying frequent itemsets in quadratic logspace (GG), pp. 25–36.

PLDI-2013-ApinisSV #equation #how

How to combine widening and narrowing for non-monotonic systems of equations (KA, HS, VV), pp. 377–386.

STOC-2013-ChakrabartyS

A o(n) monotonicity tester for boolean functions over the hypercube (DC, CS), pp. 411–418.

STOC-2013-ChakrabartyS13a #bound #testing

Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids (DC, CS), pp. 419–428.

STOC-2013-ChenPY #complexity

The complexity of non-monotone markets (XC, DP, MY), pp. 181–190.

ICML-c2-2013-Rebagliati #clustering #fault #normalisation #strict

Strict Monotonicity of Sum of Squares Error and Normalized Cut in the Lattice of Clusterings (NR), pp. 163–171.

CAV-2013-Marques-SilvaJB #set

Minimal Sets over Monotone Predicates in Boolean Formulae (JMS, MJ, AB), pp. 592–607.

CAV-2013-StewartEY #automaton #bound #model checking #polynomial #probability

Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata (AS, KE, MY), pp. 495–510.

PODS-2012-BorodinLY

Max-Sum diversification, monotone submodular functions and dynamic updates (AB, HCL, YY), pp. 155–166.

PODS-2012-LiuRV #distributed

Continuous distributed counting for non-monotonic streams (ZL, BR, MV), pp. 307–318.

ESOP-2012-Ley-WildAB #self

Non-monotonic Self-Adjusting Computation (RLW, UAA, GEB), pp. 476–496.

STOC-2012-BourgainY

Monotone expansion (JB, AY), pp. 1061–1078.

STOC-2012-ChanP #analysis #bound #fourier #network

Tight bounds for monotone switching networks via fourier analysis (SMC, AP), pp. 495–504.

BX-2012-JohnsonR #lens

Lens put-put laws: monotonic and mixed (MJ, RDR), pp. 55–67.

CADE-2011-ClaessenLS #first-order #logic

Sort It Out with Monotonicity — Translating between Many-Sorted and Unsorted First-Order Logic (KC, AL, NS), pp. 207–221.

ICLP-J-2011-CodishGBFG #analysis #constraints #integer #satisfiability #termination #using

SAT-based termination analysis using monotonicity constraints over the integers (MC, IG, AMBA, CF, JG), pp. 503–520.

SAT-2011-MundhenkZ #equivalence #how #normalisation

How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms (MM, RZ), pp. 105–119.

DATE-2010-MasrurCF

Constant-time admission control for Deadline Monotonic tasks (AM, SC, GF), pp. 220–225.

VLDB-2011-SagyKSS10 #difference #distributed #query #representation

Distributed Threshold Querying of General Functions by a Difference of Monotonic Representation (GS, DK, IS, AS), pp. 46–57.

CIAA-2010-HundeshagenOV #automaton

Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata (NH, FO, MV), pp. 163–172.

DLT-2010-OttoPM #automaton #on the

On Lexicalized Well-Behaved Restarting Automata That Are Monotone (FO, MP, FM), pp. 352–363.

DLT-2010-Schluter #automaton #lookahead #on the

On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract) (NS), pp. 440–441.

CIKM-2010-KouCZZ #learning #ranking

Learning to blend rankings: a monotonic transformation to blend rankings from heterogeneous domains (ZK, YC, ZZ, HZ), pp. 1921–1924.

CSL-2010-ChenF #on the #problem #proving #slicing

On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT (YC, JF), pp. 200–214.

IJCAR-2010-BlanchetteK #higher-order

Monotonicity Inference for Higher-Order Formulas (JCB, AK), pp. 91–106.

IJCAR-2010-NeurauterMZ #polynomial

Monotonicity Criteria for Polynomial Interpretations over the Naturals (FN, AM, HZ), pp. 502–517.

CASE-2009-WangLABH #flexibility #quality

Monotonic and non-monotonic properties of product quality in flexible manufacturing systems with batch operations (JW, JL, JA, SB, NH), pp. 13–18.

ESOP-2009-Sumii #for free #formal method #memory management

A Theory of Non-monotone Memory (Or: Contexts for free) (ES), pp. 237–251.

STOC-2009-LeeMNS #constraints

Non-monotone submodular maximization under matroid and knapsack constraints (JL, VSM, VN, MS), pp. 323–332.

ICALP-v1-2009-ArackaparambilBC #functional #monitoring

Functional Monitoring without Monotonicity (CA, JB, AC), pp. 95–106.

ICALP-v1-2009-BorosM #algorithm #parallel #performance #problem

A Fast and Simple Parallel Algorithm for the Monotone Duality Problem (EB, KM), pp. 183–194.

ICEIS-J-2009-LampertiZ #monitoring #nondeterminism

Monotonic Monitoring of Discrete-Event Systems with Uncertain Temporal Observations (GL, MZ), pp. 348–362.

ICML-2009-KotlowskiS #constraints #learning

Rule learning with monotonicity constraints (WK, RS), pp. 537–544.

ICML-2009-KuzelkaZ #relational

Block-wise construction of acyclic relational features with monotone irreducibility and relevancy properties (OK, FZ), pp. 569–576.

ICML-2009-XuJYLK #feature model

Non-monotonic feature selection (ZX, RJ, JY, MRL, IK), pp. 1145–1152.

GPCE-2009-KuhlemannBK #composition

Safe composition of non-monotonic features (MK, DSB, CK), pp. 177–186.

CAV-2009-Ben-Amram #constraints #ranking #termination

Size-Change Termination, Monotonicity Constraints and Ranking Functions (AMBA), pp. 109–123.

CAV-2009-KahlonWG #partial order #reduction

Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique (VK, CW, AG), pp. 398–413.

ICALP-A-2008-AlonH #encoding

Optimal Monotone Encodings (NA, RH), pp. 258–270.

ICALP-A-2008-BorosEM #multi #on the

On Berge Multiplication for Monotone Boolean Dualization (EB, KME, KM), pp. 48–59.

ICALP-A-2008-Dachman-SoledLMSWW #encryption #learning

Optimal Cryptographic Hardness of Learning Monotone Functions (DDS, HKL, TM, RAS, AW, HW), pp. 36–47.

ICALP-A-2008-EsparzaGKS #approximate #equation

Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations (JE, TG, SK, HS), pp. 698–710.

ICPR-2008-LiZ #algorithm #fixpoint #matrix #named #performance

FastNMF: A fast monotonic fixed-point non-negative Matrix Factorization algorithm with high ease of use (LL, YJZ), pp. 1–4.

SAC-2008-Andersson #bound #scheduling

The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50% (BA), pp. 281–283.

CAV-2008-AbdullaBCHR #abstraction #memory management #source code

Monotonic Abstraction for Programs with Dynamic Memory Heaps (PAA, AB, JC, FH, AR), pp. 341–354.

VMCAI-2008-Cousot #abstract interpretation #semantics

Abstract Interpretation of Non-monotone Bi-inductive Semantic Definitions (RC), pp. 1–3.

VLDB-2007-QiCS #graph #query

Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs (YQ, KSC, MLS), pp. 507–518.

STOC-2007-KieferLE #convergence #equation #on the #polynomial

On the convergence of Newton’s method for monotone systems of polynomial equations (SK, ML, JE), pp. 217–226.

SAC-2007-HebertBC #anti #constraints #optimisation

Optimizing hypergraph transversal computation with an anti-monotone constraint (CH, AB, BC), pp. 443–444.

SAC-2006-MitasiunaiteB #constraints #sequence #similarity

Looking for monotonicity properties of a similarity constraint on sequences (IM, JFB), pp. 546–552.

LCTES-2006-ChenK #scalability #scheduling

Procrastination for leakage-aware rate-monotonic scheduling on a dynamic voltage scaling processor (JJC, TWK), pp. 153–162.

ASE-2005-FriasGSB #analysis #performance #relational #specification #verification

A strategy for efficient verification of relational specifications, based on monotonicity analysis (MFF, RG, GS, LB), pp. 305–308.

STOC-2005-AlonS #graph

Every monotone graph property is testable (NA, AS), pp. 128–137.

STOC-2005-RubinfeldS #testing

Testing monotone high-dimensional distributions (RR, RAS), pp. 147–156.

CIAA-2005-Shcherbak #automaton #rank

The Interval Rank of Monotonic Automata (TS), pp. 273–281.

DLT-2005-Ananichev #automaton

The Mortality Threshold for Partially Monotonic Automata (DSA), pp. 112–121.

DLT-2005-JurdzinskiMOP

Monotone Deterministic RL-Automata Don’t Need Auxiliary Symbols (TJ, FM, FO, MP), pp. 284–295.

DLT-2005-Karianto #automaton #graph

Adding Monotonic Counters to Automata and Transition Graphs (KW), pp. 308–319.

ICALP-2005-Nilsson #approximate

Approximate Guarding of Monotone and Rectilinear Polygons (BJN), pp. 1362–1373.

CIKM-2005-MatsumuraT #evaluation #incremental #xpath

Incremental evaluation of a monotone XPath fragment (HM, KT), pp. 245–246.

ICML-2005-McMahanLG #bound #performance #programming #realtime

Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees (HBM, ML, GJG), pp. 569–576.

MLDM-2005-ShimizuM #anti #sequence

Disjunctive Sequential Patterns on Single Data Sequence and Its Anti-monotonicity (KS, TM), pp. 376–383.

ICLP-2005-CodishLS #constraints #termination #testing

Testing for Termination with Monotonicity Constraints (MC, VL, PJS), pp. 326–340.

ICLP-2005-SaadP #hybrid #logic programming #probability #source code

Hybrid Probabilistic Logic Programs with Non-monotonic Negation (ES, EP), pp. 204–220.

DATE-DF-2004-Horsky #precise

A 16 Bit + Sign Monotonic Precise Current DAC for Sensor Applications (PH), pp. 34–38.

TACAS-2004-ShohamG #abstraction

Monotonic Abstraction-Refinement for CTL (SS, OG), pp. 546–560.

STOC-2004-BatuKR #algorithm #sublinear #testing

Sublinear algorithms for testing monotone and unimodal distributions (TB, RK, RR), pp. 381–390.

STOC-2004-GoelRK #geometry #graph #random

Sharp thresholds For monotone properties in random geometric graphs (AG, SR, BK), pp. 580–586.

DLT-2004-JurdzinskiOMP #automaton #complexity #on the

On the Complexity of 2-Monotone Restarting Automata (TJ, FO, FM, MP), pp. 237–248.

DLT-2004-JurdzinskiOMP04a #automaton #on the

On Left-Monotone Deterministic Restarting Automata (TJ, FO, FM, MP), pp. 249–260.

ICALP-2004-HalevyK #graph #testing

Testing Monotonicity over Graph Products (SH, EK), pp. 721–732.

IJCAR-2004-BofillR #order

Redundancy Notions for Paramodulation with Non-monotonic Orderings (MB, AR), pp. 107–121.

DLT-2003-AnanichevV #automaton

Synchronizing Monotonic Automata (DSA, MVV), pp. 111–121.

ICEIS-v2-2003-KuusikL #approach #data mining #mining #using

An Approach of Data Mining Using Monotone Systems (RK, GL), pp. 482–485.

PADL-2003-PontelliBB #reasoning

Non-monotonic Reasoning on Beowulf Platforms (EP, MB, FB), pp. 37–57.

CSL-2003-AbdullaBd #game studies

Deciding Monotonic Games (PAA, AB, Jd), pp. 1–14.

LICS-2003-GradelK #fixpoint

Will Deflation Lead to Depletion? On Non-Monotone Fixed Point Inductions (EG, SK), p. 158–?.

RTA-2003-BorrallerasR #order #semantics

Monotonic AC-Compatible Semantic Path Orderings (CB, AR), pp. 279–295.

STOC-2002-EiterGM #generative

New results on monotone dualization and generating hypergraph transversals (TE, GG, KM), pp. 14–22.

STOC-2002-FischerLNRRS #testing

Monotonicity testing over general poset domains (EF, EL, IN, SR, RR, AS), pp. 474–483.

DLT-2002-IbarraDS #automaton #finite #safety #verification

Safety Verification for Two-Way Finite Automata with Monotonic Counters (OHI, ZD, ZWS), pp. 326–338.

ICPR-v3-2002-WongLC #multi #network #recognition #using

Handwritten Digit Recognition Using Multi-Layer Feedforward Neural Networks with Periodic and Monotonic Activation Functions (KWW, CSL, SJC), pp. 106–109.

CSL-2002-Chen #fixpoint #parallel

A Fixpoint Theory for Non-monotonic Parallelism (YC), pp. 120–134.

VMCAI-2002-MurawskiY #analysis

Static Monotonicity Analysis for lambda-definable Functions over Lattices (ASM, KY), pp. 139–153.

ICALP-2001-BorosEGKM #generative #integer #linear #on the

On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities (EB, KME, VG, LK, KM), pp. 92–103.

CSL-2001-Matthes #induction #rank

Monotone Inductive and Coinductive Constructors of Rank 2 (RM), pp. 600–614.

IJCAR-2001-AngerKL #logic programming #reasoning #semantics #set #source code

NoMoRe : A System for Non-monotonic Reasoning with Logic Programs under Answer Set Semantics (CA, KK, TL), pp. 325–330.

STOC-2000-HarnikR #bound

Higher lower bounds on monotone size (DH, RR), pp. 378–387.

ICALP-2000-AtseriasGG #principle #proving

Monotone Proofs of the Pigeon Hole Principle (AA, NG, RG), pp. 151–162.

CADE-2000-BorrallerasFR #order #semantics

Complete Monotonic Semantic Path Orderings (CB, MF, AR), pp. 346–364.

ICDAR-1999-UchidaS #2d #recognition #using

Handwritten Character Recognition using Monotonic and Continuous Two-dimensional Warping (SU, HS), pp. 499–502.

AGTIVE-1999-EnglertK #graph #image

Image Structure from Monotonic Dual Graph Contraction (RE, WGK), pp. 297–308.

HCI-EI-1999-KasamatsuAFIN

Effect of Menstrual Cycle on Monotonous Works Demand High Awaking Conditions (KK, MA, MFF, KI, SPN), pp. 167–172.

ICLP-1999-Zhang #rule-based

Monotonicity in Rule Based Update (YZ), pp. 471–485.

LICS-1999-BofillGNR #order

Paramodulation with Non-Monotonic Orderings (MB, GG, RN, AR), pp. 225–233.

STOC-1998-Gal #bound #source code

A Characterization of Span Program Size and Improved Lower Bounds for Monotone Span Programs (AG), pp. 429–437.

ICPR-1998-UchidaS #2d #programming

A monotonic and continuous two-dimensional warping based on dynamic programming (SU, HS), pp. 521–524.

CSL-1998-Matthes #fixpoint #normalisation

Monotone Fixed-Point Types and Strong Normalization (RM), pp. 298–312.

STOC-1996-BabaiGKRSW #bound #graph #source code

Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs (LB, AG, JK, LR, TS, AW), pp. 603–611.

OOPSLA-1996-BarrettCHMPW

A Monotonic Superclass Linearization for Dylan (KB, BC, PH, DAM, KP, PTW), pp. 69–82.

CC-1996-GeserKLRS #fixpoint #higher-order

Non-monotone Fixpoint Iterations to Resolve Second Order Effects (AG, JK, GL, OR, BS), pp. 106–120.

STOC-1995-BshoutyT #fourier #on the

On the Fourier spectrum of monotone functions (Extended Abstract) (NHB, CT), pp. 219–228.

STOC-1995-GoldmannH

Monotone circuits for connectivity have depth (log n)2-o(1) (Extended Abstract) (MG, JH), pp. 569–574.

LICS-1995-Stolboushkin

Finitely Monotone Properties (APS), pp. 324–330.

OOPSLA-1994-DucournauHHM #inheritance #multi

Proposal for a Monotonic Multiple Inheritance Linearization (RD, MH, MH, MLM), pp. 164–175.

STOC-1993-FederV #constraints #monad

Monotone monadic SNP and constraint satisfaction (TF, MYV), pp. 612–622.

SEKE-1993-Antoniou #information management #specification

Engineering Issues for No monotonic Knowledge: Structuring, Specification, Modules (GA), pp. 183–190.

ICLP-1993-Turner #logic programming #source code #theorem

A Monotonicity Theorem for Extended Logic Programs (HT), pp. 567–585.

ILPS-1993-BoerKPR #concurrent #constraints #programming

Non-monotonic Concurrent Constraint Programming (FSdB, JNK, CP, JJMMR), pp. 315–334.

RTA-1993-LevyA #order #term rewriting

Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations (JL, JAC), pp. 17–31.

TLCA-1993-Otth

Monotonic versus Antimonotonic Exponentation (DFO), pp. 318–327.

PODS-1992-RossS #database #deduction

Monotonic Aggregation in Deductive Databases (KAR, YS), pp. 114–126.

TRI-Ada-T1-1992-Roseman #analysis

Rate Monotonic Analysis (TR), pp. 261–376.

KR-1992-CroccoL #logic #on the

On the Connection between Non-monotonic Inference Systems and Conditional Logics (GC, PL), pp. 565–571.

KR-1992-Lamarre #proving #theorem proving

A Promenade from Monotonicity to Non-Monotonicity Following a Theorem Prover (PL), pp. 572–580.

OOPSLA-1992-DucournauHHM #inheritance

Monotonic Conflict Resolution Mechanisms for Inheritance (RD, MH, MH, MLM), pp. 16–24.

PEPM-1991-Klimov #functional

Dynamic Specialization in Extended Functional Language with Monotone Objects (AVK), pp. 199–210.

KR-1991-Bylander #abduction #functional #problem

The Monotonic Abduction Problem: A Functional Characterization on the Edge of Tractability (TB), pp. 70–77.

ML-1991-Bain #learning

Experiments in Non-Monotonic Learning (MB), pp. 380–384.

ISLP-1991-Przymusinski #logic programming #reasoning

Non-Monotonic Reasoning and Logic Programming (TCP), pp. 735–736.

TAV-1991-GuptaS #approach #detection #performance #runtime

Loop Monotonic Computations: An Approach for the Efficient Run-Time Detection of Races (RG, MS), pp. 98–111.

VLDB-1990-Esculier #evolution

Non-Monotonic Knowledge Evolution in VLKDBs (CE), pp. 638–649.

STOC-1990-RazW #linear

Monotone Circuits for Matching Require Linear Depth (RR, AW), pp. 287–292.

ALP-1990-Batarekh #fixpoint

Fixpoint Techniques for Non-Monotone Maps (AB), pp. 132–143.

CSL-1990-Stark #fixpoint #logic #on the

On the Existence of Fixpoints in Moore’s Autoepistemic Logic and the Non-Monotonic Logic of McDermott and Doyle (RFS), pp. 354–365.

PODS-1989-BrodskyS #constraints #datalog #source code

Inference of Monotonicity Constraints in Datalog Programs (AB, YS), pp. 190–199.

ICALP-1989-BilardiM #bound

Time Lower Bounds For CREW-PRAM Computation Of Monotone Functions (GB, AM), pp. 95–107.

KR-1989-Przymusinski #formal method #logic programming #reasoning

Three-Valued Formalizations of Non-Monotonic Reasoning and Logic Programming (TCP), pp. 341–348.

CSL-1989-Mundici

Reducibility of Monotone Formulas to μ-Formulas (DM), pp. 267–270.

NACLP-1989-Batarekh #convergence #fixpoint

Convergence Issues and Fixed Points of Non-Monotone Maps (AB), pp. 257–273.

STOC-1988-KarchmerW

Monotone Circuits for Connectivity Require Super-logarithmic Depth (MK, AW), pp. 539–550.

ICSE-1985-MillerS

Completely Monotone Regression Estimates of Software Failure Rates (DRM, AS), pp. 343–349.

STOC-1984-Boppana #bound

Threshold Functions and Bounded Depth Monotone Circuits (RBB), pp. 475–479.

STOC-1984-KlawePPY #on the #strict

On Monotone Formulae with Restricted Depth (Preliminary Version) (MMK, WJP, NP, MY), pp. 480–487.

STOC-1983-Valiant #bound #exponential #strict

Exponential Lower Bounds for Restricted Monotone Circuits (LGV), pp. 110–117.

CADE-1982-Gabbay #logic

Intuitonistic Basis for Non-Monotonic Logic (DMG), pp. 260–273.

ICALP-1980-Snir #complexity #on the

On the Size Complexity of Monotone Formulas (MS), pp. 621–631.

STOC-1978-Wegener #complexity #polynomial

Switching Functions Whose Monotone Complexity Is Nearly Quadratic (IW), pp. 143–149.

STOC-1976-Pippenger

The Realization of Monotone Boolean Functions (Preliminary Version) (NP), pp. 204–210.