Sciweavers

213 search results - page 23 / 43
» Logic programs with annotated disjunctions
Sort
View
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 8 months ago
A Non-Null Annotation Inferencer for Java Bytecode
We present a non-null annotations inferencer for the Java bytecode language. We previously proposed an analysis to infer non-null annotations and proved it soundness and completen...
Laurent Hubert
JAR
2006
94views more  JAR 2006»
13 years 8 months ago
Answer Set Programming Based on Propositional Satisfiability
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
ESWS
2005
Springer
14 years 1 months ago
Dually Structured Concepts in the Semantic Web: Answer Set Programming Approach
There is an ongoing discussion whether reasoning in the Semantic Web should be monotonic or not. It seems however that the problem concerns not only the reasoning over knowledge bu...
Patryk Burek, Rafal Grabos
AMAST
1991
Springer
13 years 11 months ago
Event Spaces and their Linear Logic
Boolean logic treats disjunction and conjunction symmetrically and algebraically. The corresponding operations for computation are respectively nondeterminism (choice) and concurr...
Vaughan R. Pratt
DKE
2010
167views more  DKE 2010»
13 years 8 months ago
The consistency extractor system: Answer set programs for consistent query answering in databases
We describe the Consistency Extractor System (ConsEx) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with...
Mónica Caniupán Marileo, Leopoldo E....