Sciweavers

JSYML
2010
68views more  JSYML 2010»
13 years 6 months ago
Stability and stable groups in continuous logic
We develop several aspects of local and global stability in continuous first order logic. In particular, we study type-definable groups and genericity.
Itaï Ben Yaacov
APAL
2002
101views more  APAL 2002»
13 years 11 months ago
The logic of tasks
The paper introduces a semantics for the language of classical first order logic supplemented with the additional operators and . This semantics understands formulas as tasks. An ...
Giorgi Japaridze
ECAI
2010
Springer
14 years 16 days ago
ProbLog Technology for Inference in a Probabilistic First Order Logic
We introduce First Order ProbLog, an extension of first order logic with soft constraints where formulas are guarded by probabilistic facts. The paper defines a semantics for FOPro...
Maurice Bruynooghe, Theofrastos Mantadelis, Angeli...
IJCAI
1989
14 years 18 days ago
The Logic of Time Structures: Temporal and Nonmonotonic Features
We Imbed Into a first order logic a representation language that combines atemporal knowledge with time stamps in a hierarchical fashion. Each time structure contains its own chro...
Mira Balaban, Neil V. Murray
KDD
1995
ACM
112views Data Mining» more  KDD 1995»
14 years 3 months ago
Learning First Order Logic Rules with a Genetic Algorithm
This paper introduces a newalgorithm called SIAO1 for learning first order logic rules withgenetic algorithms. SIAO1uses the covering principle developed in AQwhereseed examplesar...
Sébastien Augier, Gilles Venturini, Yves Ko...
CSL
2009
Springer
14 years 3 months ago
Tree-Width for First Order Formulae
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
Isolde Adler, Mark Weyer
RTA
2005
Springer
14 years 4 months ago
Automata and Logics for Unranked and Unordered Trees
In this paper, we consider the monadic second order logic (MSO) and two of its extensions, namely Counting MSO (CMSO) and Presburger MSO (PMSO), interpreted over unranked and unord...
Iovka Boneva, Jean-Marc Talbot
CSL
2005
Springer
14 years 5 months ago
The Complexity of Independence-Friendly Fixpoint Logic
We study the complexity of model-checking for the fixpoint extension of Hintikka and Sandu’s independence-friendly logic. We show that this logic captures ExpTime; and by embedd...
Julian C. Bradfield, Stephan Kreutzer
CADE
2004
Springer
14 years 11 months ago
Lambda Logic
Lambda logic is the union of first order logic and lambda calculus. We prove basic metatheorems for both total and partial versions of lambda logic. We use lambda logic to state a...
Michael Beeson