Search results for "formulas"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
72	Nick Bezhanishvili	Frame Based Formulas for Intermediate Logics.	Stud Logica	2008	DBLP DOI BibTeX RDF	frame based formulas, locally tabular logics, Intermediate logics
72	Dana Angluin, Lisa Hellerstein, Marek Karpinski	Learning Read-Once Formulas with Queries.	J. ACM	1993	DBLP DOI BibTeX RDF	?-formulas, exact identification, polynomial-time learning, read-once formulas, interpolation, membership queries, equivalence queries
67	Ran Raz, Amir Yehudayoff	Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors.	FOCS	2008	DBLP DOI BibTeX RDF
67	Haixia Jia, Cristopher Moore, Bart Selman	From Spin Glasses to Hard Satisfiable Formulas.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
67	Robert Demolombe	Syntactical Characterization of a Subset of Domain-Independent Formulas.	J. ACM	1992	DBLP DOI BibTeX RDF	relational model
67	Miodrag M. Spalevic	A note on generalized averaged Gaussian formulas.	Numer. Algorithms	2007	DBLP DOI BibTeX RDF	Averaged gaussian quadrature formulas, Gauss-Kronrod quadrature formulas
66	Allen Van Gelder, Rodney W. Topor	Safety and Translation of Relational Calculus Queries.	ACM Trans. Database Syst.	1991	DBLP DOI BibTeX RDF	allowed formulas, evaluable formulas, existential normal, relational algebra, query translation, relational calculus, domain independence
66	Daniel J. Bernstein, Tanja Lange 0001	Inverted Edwards Coordinates.	AAECC	2007	DBLP DOI BibTeX RDF	Edwards coordinates, inverted Edwards coordinates, side-channel countermeasures, unified addition formulas, strongly unified addition formulas, Elliptic curves, addition, explicit formulas, doubling
62	Robert A. Di Paola	The Solvability of the Decision Problem for Classes of Proper Formulas and Related Results.	J. ACM	1973	DBLP DOI BibTeX RDF
57	James R. Ezick	An optimizing compiler for batches of temporal logic formulas.	ISSTA	2004	DBLP DOI BibTeX RDF	model checking, temporal logic, optimizing compiler
52	Ran Raz	Tensor-rank and lower bounds for arithmetic formulas.	STOC	2010	DBLP DOI BibTeX RDF	homogenous circuits, multilinear circuits, tensor rank, lower bounds, arithmetic circuits
52	Uwe Bubeck, Hans Kleine Büning	Dependency Quantified Horn Formulas: Models and Complexity.	SAT	2006	DBLP DOI BibTeX RDF
52	Jingfen Zhang, Wen Gao 0001, Jinjin Cai, Simin He 0001, Rong Zeng, Runsheng Chen	Predicting Molecular Formulas of Fragment Ions with Isotope Patterns in Tandem Mass Spectra.	IEEE ACM Trans. Comput. Biol. Bioinform.	2005	DBLP DOI BibTeX RDF	Isotope patterns, peptide sequencing, tandem mass spectra
51	Ruymán Cruz-Barroso, Pablo González-Vera, Francisco Perdomo-Pío	An application of Szego polynomials to the computation of certain weighted integrals on the real line.	Numer. Algorithms	2009	DBLP DOI BibTeX RDF	Gaussian quadrature formulas, Szeg? polynomials, Szeg? quadrature formulas, Interpolatory type quadrature formulas, Error bounds
51	Daniel J. Bernstein, Tanja Lange 0001	Faster Addition and Doubling on Elliptic Curves.	ASIACRYPT	2007	DBLP DOI BibTeX RDF	multi-scalar multiplication, side-channel countermeasures, unified addition formulas, complete addition formulas, performance evaluation, Elliptic curves, register allocation, scalar multiplication, efficient implementation, addition, explicit formulas, doubling
47	Judy Goldsmith, Matthias Hagen, Martin Mundhenk	Complexity of DNF and Isomorphism of Monotone Formulas.	MFCS	2005	DBLP DOI BibTeX RDF
47	Edgar Altamirano, Gonzalo Escalada-Imaz	Finding Tractable Formulas in NNF.	Computational Logic	2000	DBLP DOI BibTeX RDF
47	Tai Joon Park, Allen Van Gelder	Partitioning Methods for Satisfiability Testing on Large Formulas.	CADE	1996	DBLP DOI BibTeX RDF
47	Allen Van Gelder, Rodney W. Topor	Safety and Correct Translation of Relational Calculus Formulas.	PODS	1987	DBLP DOI BibTeX RDF
47	Marko Samer, Stefan Szeider	Backdoor Sets of Quantified Boolean Formulas.	J. Autom. Reason.	2009	DBLP DOI BibTeX RDF	Backdoor sets, Variable dependencies, Parameterized complexity, Quantified Boolean formulas
47	Eugene M. Luks, Amitabha Roy 0001	The Complexity of Symmetry-Breaking Formulas.	Ann. Math. Artif. Intell.	2004	DBLP DOI BibTeX RDF	lex-leader formulas, symmetry in search, symmetry-breaking
46	Naomi Nishimura, Prabhakar Ragde, Stefan Szeider	Solving #SAT using vertex covers.	Acta Informatica	2007	DBLP DOI BibTeX RDF
46	Naomi Nishimura, Prabhakar Ragde, Stefan Szeider	Solving #SAT Using Vertex Covers.	SAT	2006	DBLP DOI BibTeX RDF
46	Gultekin Özsoyoglu, Huaqing Wang	A Relational Calculus with Set Operators, Its Safety and Equivalent Graphical Languages.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	set comparison, set manipulation, Codd relational calculus, RC/S queries, RC query, evaluable formulas, allowed formulas, RC/S* query, algorithms, relational databases, computer graphics, query languages, safety, database theory, Query-by-Example, relational calculus, graphical languages, set operators, QBE
42	Yoshinori Hijikata, Hideki Hashimoto, Shogo Nishida	Search Mathematical Formulas by Mathematical Formulas.	HCI (8)	2009	DBLP DOI BibTeX RDF	mathematical formula, search engine, index, inverted file, MathML
42	Stefan Porschen, Tatjana Schmidt	On Some SAT-Variants over Linear Formulas.	SOFSEM	2009	DBLP DOI BibTeX RDF	not-all-equal satisfiability, exact satisfiability, linear formula, linear hypergraph, bicolorability
42	Stefan Szeider	Generalizations of matched CNF formulas.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	matched formula, deficiency, biclique cover, P 2 -completeness, NP-completeness, bipartite graph, polynomial hierarchy, SAT problem
42	Jianming Jin, Xionghu Han, Qingren Wang	Mathematical Formulas Extraction.	ICDAR	2003	DBLP DOI BibTeX RDF
42	Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein	Learning Boolean Read-Once Formulas with Arbitrary Symmetric and Constant Fan-in Gates.	COLT	1992	DBLP DOI BibTeX RDF
42	Cheong Youn, Lawrence J. Henschen, Jiawei Han 0001	Classification of Recursive Formulas in Deductive Databases.	SIGMOD Conference	1988	DBLP DOI BibTeX RDF
41	Luca Pulina, Armando Tacchella	A self-adaptive multi-engine solver for quantified Boolean formulas.	Constraints An Int. J.	2009	DBLP DOI BibTeX RDF	Self-adaptive multi-engine solver, AQME, Quantified Boolean formulas
41	Stefan Erickson, Michael J. Jacobson Jr., Ning Shang, Shuo Shen, Andreas Stein	Explicit Formulas for Real Hyperelliptic Curves of Genus 2 in Affine Representation.	WAIFI	2007	DBLP DOI BibTeX RDF	reduced divisor, infrastructure and distance, Cantor’s algorithm, cryptographic key exchange, efficient implementation, hyperelliptic curve, explicit formulas
41	Vladimir Lifschitz, Alexander A. Razborov	Why are there so many loop formulas?	ACM Trans. Comput. Log.	2006	DBLP DOI BibTeX RDF	loop formulas, stable models, P-completeness, Answer sets
41	Alejandro Fernández-Margarit, Francisco Félix Lara Martín	Induction, minimization and collection for Deltan+1(T)-formulas.	Arch. Math. Log.	2004	DBLP DOI BibTeX RDF	n+1, Induction, Collection, formulas
41	Felip Manyà, Ramón Béjar, Gonzalo Escalada-Imaz	The satisfiability problem in regular CNF-formulas.	Soft Comput.	1998	DBLP DOI BibTeX RDF	Multiple-valued regular CNF-formulas, benchmarks, threshold, satisfiability problem
41	Peter E. Tischer, Gopal K. Gupta 0002	An Evaluation of Some New Cyclic Linear Multistep Formulas for Stiff ODEs.	ACM Trans. Math. Softw.	1985	DBLP DOI BibTeX RDF	cyclic linear multistep formulas, stiff differential equations
41	Howard Aizenstein, Leonard Pitt	Exact Learning of Read-Twice DNF Formulas (Extended Abstract)	FOCS	1991	DBLP DOI BibTeX RDF	read-twice DNF formulas, protocol, polynomial-time algorithm, Boolean formulas, membership queries, equivalence queries, disjunctive normal form, exact learning
41	Stefan Porschen, Ewald Speckenmeyer	Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF	(hidden) Horn formula, quadratic formula, minimal vertex cover, NP-completeness, satisfiability, fixed-parameter tractability
41	Orna Kupferman, Moshe Y. Vardi	Π2 ∩ Σ2 ≡ AFMC.	ICALP	2003	DBLP DOI BibTeX RDF
41	Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi	Homogenization and the polynomial calculus.	Comput. Complex.	2002	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000). 68Q17
41	Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi	Homogenization and the Polynominal Calculus.	ICALP	2000	DBLP DOI BibTeX RDF
37	Qingshun Zhang, Daoyun Xu	The Existence of Unsatisfiable Formulas in k-LCNF for k>=3.	TAMC	2007	DBLP DOI BibTeX RDF
37	Jianhua Zhao, Xuandong Li, Tao Zheng, Guoliang Zheng	Remove Irrelevant Atomic Formulas for Timed Automaton Model Checking.	J. Comput. Sci. Technol.	2006	DBLP DOI BibTeX RDF	model checking, formal method, timed automaton
37	Stefan Porschen, Ewald Speckenmeyer, Bert Randerath	On Linear CNF Formulas.	SAT	2006	DBLP DOI BibTeX RDF	linear CNF formula, edge colouring, linear hypergraph, NP-completeness, satisfiability, latin square
37	Uwe Bubeck, Hans Kleine Büning, Xishun Zhao	Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas.	SAT	2005	DBLP DOI BibTeX RDF
37	Jianhua Zhao, Xuandong Li, Tao Zheng, Guoliang Zheng	Removing Irrelevant Atomic Formulas for Checking Timed Automata Efficiently.	FORMATS	2003	DBLP DOI BibTeX RDF
37	Afef Kacem, Abdel Belaïd, Mohamed Ben Ahmed	Automatic extraction of printed mathematical formulas using fuzzy logic and propagation of context.	Int. J. Document Anal. Recognit.	2001	DBLP DOI BibTeX RDF	Mathematic formula extraction, Symbol labeling, Context propagation, Fuzzy logic, Document segmentation
37	Víctor Dalmau	Boolean Formulas are Hard to Learn for most Gate Bases.	ALT	1999	DBLP DOI BibTeX RDF
37	Peter Heusch	The Complexity of the Falsifiability Problem for Pure Implicational Formulas.	MFCS	1995	DBLP DOI BibTeX RDF	Subject classification algorithms and data structures, logic in computer science
36	Marat D. Ramazanov, Dzhangir Y. Rakhmatullin	Parallel Algorithms of Numeric Integration Using Lattice Cubature Formulas.	PaCT	2009	DBLP DOI BibTeX RDF	approximate integration, calculus mathematics, functional analysis, cubature formulas
36	Maurice J. Jansen, Kenneth W. Regan	"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas.	COCOON	2007	DBLP DOI BibTeX RDF	constant depth formulas, Computational complexity, lower bounds, arithmetical circuits, partial derivatives
36	Eugene Goldberg	Testing satisfiability of CNF formulas by computing a stable set of points.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	stable set of points, symmetric CNF formulas, satisfiability problem
36	Vincent Astier, Marcus Tressl	Axiomatization of local-global principles for pp-formulas in spaces of orderings.	Arch. Math. Log.	2005	DBLP DOI BibTeX RDF	Spaces of orderings, Special groups, Positive-primitive formulas, Local-global principles, Isotropy theorem, Model theory, Quadratic forms
36	Albert Atserias	On sufficient conditions for unsatisfiability of random formulas.	J. ACM	2004	DBLP DOI BibTeX RDF	Random CNF formulas, propositional resolution, satisfiability, datalog, phase transitions, pebble games
36	Ran Raz	Multi-linear formulas for permanent and determinant are of super-polynomial size.	STOC	2004	DBLP DOI BibTeX RDF	arithmetic formulas, computational complexity, lower bounds, circuit complexity, algebraic complexity
36	Wolfgang Bibel, Elmar Eder	Decomposition of tautologies into regular formulas and strong completeness of connection-graph resolution.	J. ACM	1997	DBLP DOI BibTeX RDF	connection-graph resolution, decomposition of unsatisfiable formulas, semantic trees, regular graphs, strong completeness
36	Viktor Kuncak, Martin C. Rinard	Boolean Algebra of Shape Analysis Constraints.	VMCAI	2004	DBLP DOI BibTeX RDF
36	Carlos Ansótegui, Felip Manyà	New Logical and Complexity Results for Signed-SAT.	ISMVL	2003	DBLP DOI BibTeX RDF
36	Randal E. Bryant, Steven M. German, Miroslav N. Velev	Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic.	ACM Trans. Comput. Log.	2001	DBLP DOI BibTeX RDF	processor verfication, decision procedures, uninterpreted functions
36	Yaniv Bargury, Johann A. Makowsky	The Expressive Power of Transitive Closue and 2-way Multihead Automata.	CSL	1991	DBLP DOI BibTeX RDF
35	Sudeshna Dasgupta, Vijay Chandru	Minimal Unsatisfiable Sets: Classification and Bounds.	ASIAN	2004	DBLP DOI BibTeX RDF	Minimal Unsatisfiable Sets, satisfiability, propositional logic, Boolean formulas
35	Keith W. Miller 0001, Larry J. Morell, Robert E. Noonan, Stephen K. Park, David M. Nicol, Branson W. Murrill, Jeffrey M. Voas	Estimating the Probability of Failure When Testing Reveals No Failures.	IEEE Trans. Software Eng.	1992	DBLP DOI BibTeX RDF	failure probability estimation, random testing results, input distribution, prior assumptions, failure estimate, discrete sample space statistical model, Bayesian prior assumptions, life-critical applications, probability, program testing, Bayes methods, formulas
35	Cindy Eisner, Dana Fisman, John Havlicek	A topological characterization of weakness.	PODC	2005	DBLP DOI BibTeX RDF	safety component, semantically weak and strong formulas, syntactically weak and strong formulas, temporal weakness and strength, weak and strong components, safety, liveness
31	Guohua Liu	Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Programs.	LPNMR	2009	DBLP DOI BibTeX RDF
31	Daniel Johannsen, Igor Razgon, Magnus Wahlström	Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences.	SAT	2009	DBLP DOI BibTeX RDF
31	Pascal Koiran, Klaus Meer	On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width.	WG	2008	DBLP DOI BibTeX RDF
31	Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer	Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics.	ISMVL	2008	DBLP DOI BibTeX RDF	Helly property, complexity, satisfiability, many-valued logic, propositional logic
31	Marko Samer, Stefan Szeider	Backdoor Sets of Quantified Boolean Formulas.	SAT	2007	DBLP DOI BibTeX RDF
31	Kai Lin, David Chen 0002, R. Geoff Dromey, Chengzheng Sun	Maintaining constraints expressed as formulas in collaborative systems.	CollaborateCom	2007	DBLP DOI BibTeX RDF
31	Masahito Hayashi	General formulas for fixed-length quantum entanglement concentration.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
31	Uriel Feige, Jeong Han Kim, Eran Ofek	Witnesses for non-satisfiability of dense random 3CNF formulas.	FOCS	2006	DBLP DOI BibTeX RDF
31	Husam Abu-Haimed, David L. Dill, Sergey Berezin	A Refinement Method for Validity Checking of Quantified First-Order Formulas in Hardware Verification.	FMCAD	2006	DBLP DOI BibTeX RDF
31	Salamah Salamah, Ann Q. Gates, Steve Roach, Oscar Mondragon	Verifying Pattern-Generated LTL Formulas: A Case Study.	SPIN	2005	DBLP DOI BibTeX RDF
31	Wei Xiao, Eng-Wee Chionh	Formal Power Series and Loose Entry Formulas for the Dixon Matrix.	IWMM/GIAE	2004	DBLP DOI BibTeX RDF
31	Miroslav N. Velev	Efficient translation of boolean formulas to CNF in formal verification of microprocessors.	ASP-DAC	2004	DBLP DOI BibTeX RDF
31	Uriel Feige, Eran Ofek	Easily Refutable Subformulas of Large Random 3CNF Formulas.	ICALP	2004	DBLP DOI BibTeX RDF
31	Andrei A. Bulatov, Hubie Chen, Víctor Dalmau	Learnability of Relatively Quantified Generalized Formulas.	ALT	2004	DBLP DOI BibTeX RDF
31	Jan Chomicki	Preference formulas in relational queries.	ACM Trans. Database Syst.	2003	DBLP DOI BibTeX RDF	query optimization, relational algebra, preferences, Preference queries
31	Lisa Hellerstein, Vijay Raghavan 0002	Exact learning of DNF formulas using DNF hypotheses.	STOC	2002	DBLP DOI BibTeX RDF	representations of boolean functions, algorithms, certificates, complexity theory, computational learning theory, disjunctive normal form, DNF
31	Kenichi Toyozumi, Kensaku Mori, Yasuhito Suenaga, Takahiro Suzuki	A System for Real-time Recognition of Handwritten Mathematical Formulas.	ICDAR	2001	DBLP DOI BibTeX RDF
31	Jerry L. Prince	Convolution backprojection formulas for 3-D vector tomography with application to MRI.	IEEE Trans. Image Process.	1996	DBLP DOI BibTeX RDF
31	Neil V. Murray, Erik Rosenthal	Signed Formulas: A Liftable Meta-Logic for Multiple-Valued Logics.	ISMIS	1993	DBLP DOI BibTeX RDF
31	Harry B. Hunt III, Richard Edwin Stearns	Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report).	STACS	1986	DBLP DOI BibTeX RDF
31	Ran Raz	Multi-linear formulas for permanent and determinant are of super-polynomial size.	J. ACM	2009	DBLP DOI BibTeX RDF	arithmetic formulas, lower bounds, circuit complexity, algebraic complexity
31	Gabriel Aranda-López, Susana Nieva, Fernando Sáenz-Pérez, Jaime Sánchez-Hernández	Implementing a fixed point semantics for a constraint deductive database based on hereditary harrop formulas.	PPDP	2009	DBLP DOI BibTeX RDF	hereditary harrop formulas, constraints, prolog, deductive databases, fixpoint semantics, stratification
31	K. Subramani 0001	Optimal length tree-like resolution refutations for 2SAT formulas.	ACM Trans. Comput. Log.	2004	DBLP DOI BibTeX RDF	2SAT formulas, tree-like proofs, Resolution
31	Stephen Bique	Useful formulas for multidimensional arrays.	APL	2003	DBLP DOI BibTeX RDF	problem specification, program, calculus, formulas
31	Edith Hemaspaandra, Gerd Wechsung	The Minimization Problem for Boolean Formulas.	FOCS	1997	DBLP DOI BibTeX RDF	computational complexity, minimization, propositional logic, Boolean formulas, polynomial hierarchy
31	Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol	(1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms.	SAT	2009	DBLP DOI BibTeX RDF
31	Ran Raz, Iddo Tzameret	The Strength of Multilinear Proofs.	Comput. Complex.	2008	DBLP DOI BibTeX RDF	Subject classification. 03F20, 68Q17, 13P10
31	Klaus Denecke, Dara Phusanga	Hyperformulas and Solid Algebraic Systems.	Stud Logica	2008	DBLP DOI BibTeX RDF	AMS subject classification 03B50, 08A46, 08A30
31	Antonio Di Nola, Ada Lettieri	On normal forms in Lukasiewicz logic.	Arch. Math. Log.	2004	DBLP DOI BibTeX RDF	McNaughton function, Separation of variables
30	Amir Shpilka, Ilya Volkovich	Read-once polynomial identity testing.	STOC	2008	DBLP DOI BibTeX RDF	bounded depth circuits, identity testing, read-once formulas, reconstruction, arithmetic circuits
30	Yuesheng Li	The Inversion of Multiscale Convolution Approximation and Average of Distributions.	Adv. Comput. Math.	2003	DBLP DOI BibTeX RDF	average of distributions, EB-splines, inversion formulas, multiscale convolution approximations, wavelets
30	Paul Beame, Toniann Pitassi	Simplified and Improved Resolution Lower Bounds.	FOCS	1996	DBLP DOI BibTeX RDF	resolution lower bounds, randomly generated formulas, random formulas, randomly chosen 3-CNF formula, lower bounds, computability, pigeonhole principle
30	Howard Aizenstein, Lisa Hellerstein, Leonard Pitt	Read-Thrice DNF Is Hard to Learn With Membership and Equivalence Queries	FOCS	1992	DBLP DOI BibTeX RDF	disjunctive normal, nonlearnability, polynomial-time membership, read-thrice DNF formulas, membership, boolean formulas, equivalence queries, exact learning
30	Mike Paterson, Nicholas Pippenger, Uri Zwick	Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions	FOCS	1990	DBLP DOI BibTeX RDF	multiplication circuits, multiple addition, shallowest possible circuits, shortest possible formulas, occurrence matrix, shortest multiple carry-save addition formulas, delay matrix, multiple carry-save adders, multiplication, symmetric Boolean functions, carry-save addition
26	GuoJun Wang, QiaoLin Duan	Theory of (n) truth degrees of formulas in modal logic and a consistency theorem.	Sci. China Ser. F Inf. Sci.	2009	DBLP DOI BibTeX RDF	(n) truth degrees, consistency theorem, (n) modality similarity degrees, (n) modality logic metric space, temporal logic, modal logic, approximate reasoning
26	Hiroki Morizumi	Limiting Negations in Formulas.	ICALP (1)	2009	DBLP DOI BibTeX RDF
26	Hans Kleine Büning, Xishun Zhao, Uwe Bubeck	Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits.	SAT	2009	DBLP DOI BibTeX RDF