Sciweavers

2084 search results - page 178 / 417
» Set Constraints in Logic Programming
Sort
View
ESWS
2010
Springer
13 years 10 months ago
Dealing with Inconsistency When Combining Ontologies and Rules Using DL-Programs
Abstract. Description Logic Programs (DL-programs) have been introduced to combine ontological and rule-based reasoning in the context of the Semantic Web. A DL-program loosely com...
Jörg Pührer, Stijn Heymans, Thomas Eiter
ISMVL
1999
IEEE
90views Hardware» more  ISMVL 1999»
14 years 19 days ago
Transformations between Signed and Classical Clause Logic
In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
ACL
2001
13 years 9 months ago
Extending Lambek Grammars: a Logical Account of Minimalist Grammars
We provide a logical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. Our logical definition leads to a neat relation...
Alain Lecomte, Christian Retoré
VMCAI
2004
Springer
14 years 1 months ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
POPL
2007
ACM
14 years 8 months ago
Semantics of static pointcuts in aspectJ
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...
Pavel Avgustinov, Elnar Hajiyev, Neil Ongkingco, O...