Sciweavers

282 search results - page 41 / 57
» Propositional Fusion Rules
Sort
View
RTA
2010
Springer
13 years 11 months ago
A Proof Calculus Which Reduces Syntactic Bureaucracy
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...
Alessio Guglielmi, Tom Gundersen, Michel Parigot
ISMIS
2000
Springer
13 years 11 months ago
Top-Down Query Processing in First Order Deductive Databases under the DWFS
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...
C. A. Johnson
DALT
2009
Springer
13 years 11 months ago
Ontology and Time Evolution of Obligations and Prohibitions Using Semantic Web Technology
The specification and monitoring of conditional obligations and prohibitions with starting points and deadlines is a crucial aspect in the design of open interaction systems. In th...
Nicoletta Fornara, Marco Colombetti
AAAI
2007
13 years 10 months ago
Reasoning about Bargaining Situations
This paper presents a logical axiomatization of bargaining solutions. A bargaining situation is described in propositional logic and the bargainers’ preferences are quantified ...
Dongmo Zhang
AAAI
2008
13 years 10 months ago
Revising Imprecise Probabilistic Beliefs in the Framework of Probabilistic Logic Programming
Probabilistic logic programming is a powerful technique to represent and reason with imprecise probabilistic knowledge. A probabilistic logic program (PLP) is a knowledge base whi...
Anbu Yue, Weiru Liu