Sciweavers

311 search results - page 54 / 63
» A Bialgebraic Approach to Automata and Formal Language Theor...
Sort
View
ICFCA
2005
Springer
14 years 2 months ago
On Computing the Minimal Generator Family for Concept Lattices and Icebergs
Minimal generators (or mingen) constitute a remarkable part of the closure space landscape since they are the antipodes of the closures, i.e., minimal sets in the underlying equiva...
Kamal Nehmé, Petko Valtchev, Mohamed Rouane...
KR
2010
Springer
14 years 1 months ago
Multi-Agent Only-Knowing Revisited
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavio...
Vaishak Belle, Gerhard Lakemeyer
IJCAI
2007
13 years 10 months ago
Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge-Base Combination
In the context of the Semantic Web, several approaches to the combination of ontologies, given in terms of theories of classical first-order logic, and rule bases have been propo...
Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans T...
GG
2010
Springer
13 years 9 months ago
Multi-Amalgamation in Adhesive Categories
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
Ulrike Golas, Hartmut Ehrig, Annegret Habel
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
14 years 1 months ago
Typed compilation of recursive datatypes
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, K...