Sciweavers

2236 search results - page 98 / 448
» Language Independence and Language Tolerance in Logic Progra...
Sort
View
KR
2010
Springer
15 years 11 months ago
Maximally Paraconsistent Three-Valued Logics
Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as p...
Ofer Arieli, Arnon Avron, Anna Zamansky
SAC
2008
ACM
15 years 5 months ago
Symbiosis in logic-based pointcuts over a history of join points
Within aspect-oriented programming, the quality of aspect code depends on the readability and expressiveness of pointcut languages. Readability is increased by using specialized, ...
Kris Gybels, Charlotte Herzeel, Theo D'Hondt
ADC
2006
Springer
142views Database» more  ADC 2006»
16 years 10 days ago
An optimization for query answering on ALC database
Query answering over OWLs and RDFs on the Semantic Web is, in general, a deductive process. To this end, OWL, a family of web ontology languages based on description logic, has be...
Pakornpong Pothipruk, Guido Governatori
FUIN
2008
116views more  FUIN 2008»
15 years 6 months ago
On the Relationship between Description Logic-based and F-Logic-based Ontologies
Many popular ontology languages are based on (subsets of) first-order predicate logic, with classes represented by unary predicates and properties by binary predicates. Specificall...
Jos de Bruijn, Stijn Heymans
IWMM
2009
Springer
164views Hardware» more  IWMM 2009»
16 years 27 days ago
Live heap space analysis for languages with garbage collection
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...