• No results found

temporal first order logic

Efficient First-Order Temporal Logic for Infinite-State Systems

Efficient First-Order Temporal Logic for Infinite-State Systems

... the first order part to some decidable fragment of first-order logic, such as the guarded, two-variable or monadic ...monodic temporal formulae is to use fine-grained ...

16

Temporalising OWL 2 QL

Temporalising OWL 2 QL

... the temporal DL literature, a similar distinction has been discussed as the difference between temporalised axioms and temporalised concepts/roles; the expressive power of the respective languages is incomparable ...

13

Bisimulations for temporal logic

Bisimulations for temporal logic

... Irr Section 5 we show that a first-order formula in the correspondence language Lsry is equivalent to a temporal formula with Since and Until iff it is invariant for the notion of bisimu[r] ...

25

Chinese Named Entity Abbreviation Generation Using First Order Logic

Chinese Named Entity Abbreviation Generation Using First Order Logic

... Markov logic to incor- porate both local features and global constraints that hold between temporal ...by First-Order Logic (FOL) rules, into LDA inference to produce topics shaped by ...

9

An Apriori-based Approach for First-Order Temporal Pattern

An Apriori-based Approach for First-Order Temporal Pattern

... Inductive Logic Programming (ILP) ([Masson and Jacquenet 2002; Lee and Raedt 2002]) proposed temporal formalisms which are more expressive than the ones used so far for modeling sequential ...propositional ...

14

First order rewritability of temporal ontology mediated queries

First order rewritability of temporal ontology mediated queries

... The aim of this paper is to launch a systematic investigation of rewritability of TOMQs with arbitrary temporal operators. Apart from FO(<), we consider two more target languages for rewritings: FO(<, +), ...

8

The First-Order Logic of Hyperproperties

The First-Order Logic of Hyperproperties

... The extension from LTL to HyperLTL has fundamentally changed the models of the logic. While a satisfiable LTL formula is guaranteed to have an ultimately periodic model, we have shown that there is no guarantee ...

14

PP 2016 26: 
  On a New Semantics for First Order Predicate Logic

PP 2016 26: On a New Semantics for First Order Predicate Logic

... the logic. Basic A-­‐logic obviously lacks laws of monotonicity or distribution over disjunction, but it does validate, for instance, the following basic prenex distribution law: ...

9

PP 2009 40: 
  First Order Logic Formalisation of Arrow's Theorem

PP 2009 40: First Order Logic Formalisation of Arrow's Theorem

... ways. First, it is likely that a refor- mulation of the axioms and a guided use of the theorem prover will significantly improve performance and lead to the creation of a usable tool for social choice theorem ...

14

The Triguarded Fragment of First-Order Logic

The Triguarded Fragment of First-Order Logic

... in order to check satisfiability in TGF , it suffices to consider the satisfiability problem for GFU , and thus in the rest of the paper we focus on GFU ...

16

Relevant First-Order Logic LP# and Curry’s Paradox Resolution

Relevant First-Order Logic LP# and Curry’s Paradox Resolution

... The basic version of Curry’s paradox shows that any such set theory is trivial if its underlying logic contains the rules of Unrestricted Modus Ponens (1.1)and Contraction, in addition to the usual Instantiation ...

7

Representing the Process of Machine Tool Calibration in First order Logic

Representing the Process of Machine Tool Calibration in First order Logic

... in first-order logic for a machine tool with three perpendicular linear axes, which each have seven geometric errors that use different instrumentation for ...

7

Logic Programs vs  First Order Formulas in Textual Inference

Logic Programs vs First Order Formulas in Textual Inference

... In this paper we argue, however, that these two versions of the logic approach to textual entailment have more in common than meets the eye. A large part of the work done by Bos and Markert can be understood in ...

6

Expressing Disjunctive and Negative Feature Constraints With Classical First Order Logic

Expressing Disjunctive and Negative Feature Constraints With Classical First Order Logic

... Further, first-order logic can be used to axiomatize other types of feature structures in addition to attribute-value structures such as "set-valued" elements and express a wider variety[r] ...

7

DLS-Forgetter: An Implementation of the DLS Forgetting Calculus for First-Order Logic

DLS-Forgetter: An Implementation of the DLS Forgetting Calculus for First-Order Logic

... To summarise, this paper has introduced DLS-Forgetter ; a practical nonstandard reasoning system that provides functionality for forgetting. The system is inspired by the DLS algorithm [5] with some optimisations that ...

12

Proof theoretic investigations into integrated logical and functional programming

Proof theoretic investigations into integrated logical and functional programming

... a logic programming language called FOPLP, based on the theory of first-order hereditary Harrop ...integrating logic and functional programming.) For describing hereditary Harrop logic, ...

187

Wires, P=NP in Applied Logic

Wires, P=NP in Applied Logic

... Keywords – First order logic, logic gates, Turing machine, Foundation of computer architecture, using logic gates to program, networks of wires to replace transistors.[r] ...

7

Second order logic is logic

Second order logic is logic

... In his presentation of the concept script in the Begriffsschrift. Frege laid the groundwork for his project of proving arithmetic to be part of logic. This is a technical work, introducing a new method of proof. ...

226

A Complete Cyclic Proof System for Inductive Entailments in First Order Logic

A Complete Cyclic Proof System for Inductive Entailments in First Order Logic

... For this reason, the developments in this section are inspired by a state-of-the-art language inclusion algorithm for top-down tree automata [9], briefly explained next. Our method for developing a proof system (set of ...

19

Question Answering over Linked Data Using First order Logic

Question Answering over Linked Data Using First order Logic

... by first converting natural language utterances into meaningful representations ...limited logic form with the semantic item query, which we believe is more appropriate for answering factoid ...

12

Show all 10000 documents...

Related subjects