Sciweavers

4266 search results - page 22 / 854
» A Framework for Defining Logics
Sort
View
CIE
2009
Springer
15 years 1 months ago
Functions Definable by Arithmetic Circuits
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
Ian Pratt-Hartmann, Ivo Düntsch
ENC
2006
IEEE
15 years 1 months ago
Defining new argumentation-based semantics by minimal models
Dung's argumentation approach is a unifying approach which has played an influential role on argumentation research and Artificial Intelligence (AI). Based on a proper repres...
Juan Carlos Nieves, Ulises Cortés, Mauricio...
IAJIT
2008
94views more  IAJIT 2008»
14 years 9 months ago
Enforcing User-Defined Constraints during the Run-Time in OODB
: In this paper a run-time model is proposed. The run-time model enforces integrity constraints for attributes that are derived from composition and inheritance hierarchies. The ru...
Belal Zaqaibeh, Hamidah Ibrahim, Ali Mamat, Md Nas...
DLT
2004
14 years 11 months ago
Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey
New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...
Bruno Courcelle
IJCAI
1989
14 years 10 months ago
Measure-Free Conditioning, Probability and Non-Monotonic Reasoning
Recent results in the foundations of probability theory indicate that a conditional probability can be viewed as a probability attached to a mathematical entity called a measure-f...
Didier Dubois, Henri Prade