Sciweavers

45 search results - page 5 / 9
» Conceptual Graphs and First Order Logic
Sort
View
JAPLL
2008
101views more  JAPLL 2008»
13 years 8 months ago
Circle graphs and monadic second-order logic
A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique rep...
Bruno Courcelle
GLVLSI
1996
IEEE
145views VLSI» more  GLVLSI 1996»
14 years 3 days ago
Boolean Function Representation Using Parallel-Access Diagrams
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...
Valeria Bertacco, Maurizio Damiani
DLOG
1996
13 years 9 months ago
Towards a Legal Reasoning System based on Description Logics: A Position Paper
fe. Althoughthose legal concepts are abstract in the sense that there always exist possibilities to interpret them in various ways, lawyers seem to understand themas real things at...
Makoto Haraguchi
ICDE
2007
IEEE
103views Database» more  ICDE 2007»
14 years 9 months ago
A Semantic Approach to Discovering Schema Mapping Expressions
In many applications it is important to find a meaningful relationship between the schemas of a source and target database. This relationship is expressed in terms of declarative ...
Alexander Borgida, John Mylopoulos, Renée J...
EJC
2010
13 years 8 months ago
Dualities in full homomorphisms
Abstract. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-ed...
Richard N. Ball, Jaroslav Nesetril, Ales Pultr