KRDB RESEARCH CENTRE KNOWLEDGE REPRESENTATION MEETS DATABASES Faculty of Computer Science, Free University of Bozen-Bolzano, Piazza Domenicani 3, 39100 Bolzano, Italy Tel: +, fax: +, http://ww

Source URL: www.inf.unibz.it

• Mathematics
• Logic
• Mathematical logic
• Ontology
• Boolean algebra
• Mereology
• Predicate logic
• Algebraic logic
• ZermeloFraenkel set theory
• Binary relation
• Power set
• Mereotopology

The complexity of satisfaction problems in Reverse Mathematics Ludovic Patey Laboratoire PPS, Université Paris Diderot, Paris, FRANCE

Source URL: ludovicpatey.com

• Logic
• Mathematics
• Constraint programming
• Abstraction
• Model theory
• Boolean satisfiability problem
• Electronic design automation
• Logic in computer science
• Complexity of constraint satisfaction
• Constraint satisfaction problem
• Satisfiability
• Binary relation

2012 ACM@UVa HSPC Java Cheatsheet If Statement Primitive Data Types if ( Boolean Expression ){

Source URL: acm.cs.virginia.edu

Hoogλe Finding Functions from Types Neil Mitchell haskell.org/hoogle community.haskell.org/~ndm/

Source URL: ndmitchell.com

• Software engineering
• Computing
• Computer programming
• Data types
• Functional languages
• Primitive types
• Functional programming
• Edit distance
• String
• Haskell
• Id
• Boolean data type

2012 ACM@UVa HSPC C++ Cheatsheet If Statement Primitive Data Types if ( Boolean Expression ){

Source URL: acm.cs.virginia.edu

Tutorial on Universal Algebra, Mal’cev Conditions, and Finite Relational Structures: Lecture I Ross Willard University of Waterloo, Canada BLAST 2010

Source URL: spot.colorado.edu

• Mathematical structures
• Universal algebra
• Abstract algebra
• Algebraic structures
• Mathematical logic
• Algebra
• Variety
• Boolean algebra
• F-algebra
• Structure
• Boolean algebras canonically defined
• Heyting algebra

Finding Composition Trees for Multiple-Valued Functions E. V. Dubrova, J. C. Muzio VLSI Design and Test Group University of Victoria, P.O.Box 3055 Victoria, B.C., Canada, V8W 3P6

Source URL: www.maths.lse.ac.uk

• Mathematics
• Functions and mappings
• Boolean algebra
• Engineering
• Functional decomposition
• Philosophy of mathematics
• Philosophy of physics
• Function composition
• Ear decomposition
• Tree
• Function
• Boolean function

Open problems in Boolean algebras over partially ordered sets Mohamed Bekkali University sidi mohamed ben abdullah (USMBA) Fez, Morocco

Source URL: spot.colorado.edu

• Algebra
• Mathematics
• Abstract algebra
• Boolean algebra
• Algebraic logic
• Algebraic structures
• Lattice theory
• Algebra over a field
• Heyting algebra
• Complete Boolean algebra

Combining Existential Rules and Description Logics Antoine Amarilli1,2 , Michael Benedikt2 1 Télécom 2 University ParisTech, Paris, France

Source URL: a3nm.net

• Computing
• Logic
• Boolean algebra
• Conjunctive query
• Database theory
• Description logic
• Web standards
• FO
• Boolean conjunctive query
• Web Ontology Language

Remark on the history of Boolean models September 14, 2013 Introduction In [4], D. Scott refers to an early presentation of Boolean-valued model, due to P. Lagerstr¨om, which is described in [2]. What is presented howev

Source URL: www.cse.chalmers.se