Results 1  10
of
86
Twovariable logic on words with data
 In LICS
, 2006
"... Abstract — In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semistructured data, timed automata and extended temporal logics. It is shown that satisfiability for the twovariable ..."
Abstract

Cited by 80 (18 self)
 Add to MetaCart
variable firstorder logic FO 2 (∼, <, +1) is decidable over finite and over infinite data words, where ∼ is a binary predicate testing the data value equality and +1,< are the usual successor and order predicates. The complexity of the problem is at least as hard as Petri net reachability. Several
A DefaultLogic Framework for Legal Reasoning in Multiagent Systems
"... Using law and evidence to achieve fair and accurate decisions in numerous legal cases requires a complex multiagent system. This paper discusses a framework based on manyvalued, predicate, default logic that successfully captures legal knowledge, integrates and evaluates expert and nonexpert evide ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Using law and evidence to achieve fair and accurate decisions in numerous legal cases requires a complex multiagent system. This paper discusses a framework based on manyvalued, predicate, default logic that successfully captures legal knowledge, integrates and evaluates expert and non
Predicate Logic based Image Grammars for Complex Pattern Recognition
"... Reliably detecting patterns in visual data has been the primary goal of computer vision research for several years. Such patterns could be strictly spatial in nature, like static images of pedestrians, bicycles, airplanes etc., or spatiotemporal in nature, like patterns of human or vehicular activit ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
activity over time. Lately, there has been increased interest in using image grammars to represent and parse visual images and detect such patterns [5, 4]. Predicate logic based reasoning approaches provide one such means to formally specify domain knowledge, and manipulate symbolic information
A DefaultLogic Framework for Legal Reasoning in Multiagent Systems
"... Using law and evidence to achieve fair and accurate decisions in numerous legal cases requires a complex multiagent system. This paper discusses a framework based on manyvalued, predicate, default logic that successfully captures legal knowledge, integrates and evaluates expert and nonexpert evide ..."
Abstract
 Add to MetaCart
Using law and evidence to achieve fair and accurate decisions in numerous legal cases requires a complex multiagent system. This paper discusses a framework based on manyvalued, predicate, default logic that successfully captures legal knowledge, integrates and evaluates expert and non
Two Variable FirstOrder Logic over Ordered Domains
 Journal of Symbolic Logic
, 1998
"... The satisfiability problem for the twovariable fragment of firstorder logic is investigated over finite and infinite linearly ordered, respectively wellordered domains, as well as over finite and infinite domains in which one or several designated binary predicates are interpreted as arbitrary wel ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
The satisfiability problem for the twovariable fragment of firstorder logic is investigated over finite and infinite linearly ordered, respectively wellordered domains, as well as over finite and infinite domains in which one or several designated binary predicates are interpreted as arbitrary
Multiadjoint Fuzzy Logic Programming with Defaults and Constructive Answers
"... In this paper we present the semantics of RFuzzy, a fuzzy Logic Programming framework that represents truth values using real numbers from the unit interval. RFuzzy provides some useful extensions: default values to represent missing information, and typed arguments to intuitively restrict predicat ..."
Abstract
 Add to MetaCart
In this paper we present the semantics of RFuzzy, a fuzzy Logic Programming framework that represents truth values using real numbers from the unit interval. RFuzzy provides some useful extensions: default values to represent missing information, and typed arguments to intuitively restrict
On the Complexity of Equational Problems in CNF over a Finite Domain
, 2000
"... Equational problems (i.e.: firstorder formulae with quantifier prefix 9 8 , whose only predicate symbol is syntactic equality) are an important tool in many areas of Computer Science like automated deduction, automated model building, logic programming, functional programming, etc. The aim of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of this work is a complexity analysis of the satisfiability problem of equational problems over a finite domain. Our main result is the \Sigma p 2 completeness proof for equational problems in CNF.
Twovariable logic on data words
, 2007
"... In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semistructured data, timed automata and extended temporal logics. It is shown that satisfiability for the twovariable firstorder ..."
Abstract

Cited by 35 (4 self)
 Add to MetaCart
order logic FO 2 (∼,<,+1) is decidable over finite and over infinite data words, where ∼ is a binary predicate testing the data value equality and +1, < are the usual successor and order predicates. The complexity of the problem is at least as hard as Petri net reachability. Several extensions
Materials for an exploratory theory of the network society.
 The British Journal of Sociology
, 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, crosscultural investigation. It permeates most societies in the world, in v ..."
Abstract

Cited by 122 (0 self)
 Add to MetaCart
organizational forms, rooted in a different social logic. In this sense, they tend to assert the predominance of social morphology over social action. Let me clarify the meaning of this statement by entering into the heart of the argument, that is, by examining how speci cally the introduction of information 16
LTL with the freeze quantifier and register automata
 In LICS’06
, 2006
"... Temporal logics, firstorder logics, and automata over data words have recently attracted considerable attention. A data word is a word over a finite alphabet, together with a datum (an element of an infinite domain) at each position. Examples include timed words and XML documents. To refer to the d ..."
Abstract

Cited by 75 (7 self)
 Add to MetaCart
to the data, temporal logics are extended with the freeze quantifier, firstorder logics with predicates over the data domain, and automata with registers or pebbles. We investigate relative expressiveness and complexity of standard decision problems for LTL with the freeze quantifier (LTL ↓), 2variable
Results 1  10
of
86