UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Verification of Agent-Based Artifact Systems

The Journal of artificial intelligence research, 2014-01, Vol.51, p.333-376

2014

Volltextzugriff (PDF)

Interactions between Knowledge and Time in a First-Order Logic for Multi-Agent Systems: Completeness Results

The Journal of artificial intelligence research, 2012-01, Vol.45, p.1-45

2012

Volltextzugriff (PDF)

Quantified epistemic logics for reasoning about knowledge in multi-agent systems

Artificial intelligence, 2009-06, Vol.173 (9), p.982-1013

2009

Volltextzugriff (PDF)

Automated Negotiation: Prospects, Methods and Challenges

Group decision and negotiation, 2001-03, Vol.10 (2), p.199-215

2001

Volltextzugriff (PDF)

Deontic Logic in Computer Science: 7th International Workshop on Deontic Logic in Computer Science, DEON 2004, Madeira, Portugal, May 26-28, 2004. Proceedings

2004., 2004

Volltextzugriff (PDF)

Combining fault injection and model checking to verify fault tolerance, recoverability, and diagnosability in multi-agent systems

Information and computation, 2017-06, Vol.254, p.167-194

2017

Volltextzugriff (PDF)

4th International Workshop on Strategic Reasoning (SR 2016)

Information and computation, 2018-08, Vol.261, p.615-615

2018

Volltextzugriff (PDF)

A Sound-and-Complete Propagation-Based Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks

2015 22nd International Symposium on Temporal Representation and Reasoning (TIME), 2016, p.4-18

2016

Volltextzugriff (PDF)

22nd International Symposium on Temporal Representation and Reasoning (TIME 2015)

Information and computation, 2018-04, Vol.259, p.303-304

2018

Volltextzugriff (PDF)

Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: A Singly-Exponential Time DC-checking

2015 22nd International Symposium on Temporal Representation and Reasoning (TIME), 2016, p.19-28

2016

Volltextzugriff (PDF)

Complexity of ITL Model Checking: Some Well-Behaved Fragments of the Interval Logic HS

2015 22nd International Symposium on Temporal Representation and Reasoning (TIME), 2016, p.90-100

2016

Volltextzugriff (PDF)

Temporal Aspects of Big Data Management: State-of-the-Art Analysis and Future Research Directions

2015 22nd International Symposium on Temporal Representation and Reasoning (TIME), 2016, p.180-185

Cuzzocrea, Alfredo

2016

Volltextzugriff (PDF)

An Executable Semantics of Flexible Plans in Terms of Timed Game Automata

2015 22nd International Symposium on Temporal Representation and Reasoning (TIME), 2016, p.160-169

2016

Volltextzugriff (PDF)

A Team Based Variant of CTL

2015 22nd International Symposium on Temporal Representation and Reasoning (TIME), 2016, p.140-149

2016

Volltextzugriff (PDF)

On the Counting of Strategies

2015 22nd International Symposium on Temporal Representation and Reasoning (TIME), 2016, p.170-179

2016

Volltextzugriff (PDF)

Designing a Deontic Logic of Deadlines

Deontic Logic in Computer Science, 2004, Vol.3065, p.43-56

2004

Volltextzugriff (PDF)

Automated Verification of Quantum Protocols using MCMAS

Electronic proceedings in theoretical computer science, 2012-07, Vol.85 (Proc. QAPL 2012), p.48-62

2012

Volltextzugriff (PDF)

Global Caching for the Flat Coalgebraic µ-Calculus

2015 22nd International Symposium on Temporal Representation and Reasoning (TIME), 2016, p.121-130

2016

Volltextzugriff (PDF)

Bounded Model Checking for Interpreted Systems: Preliminary Experimental Results

Formal Approaches to Agent-Based Systems, 2003, p.115-125

2003

Volltextzugriff (PDF)

The Price of Evolution in Temporal Databases

2015 22nd International Symposium on Temporal Representation and Reasoning (TIME), 2016, p.47-58

2016

Volltextzugriff (PDF)

Fast Feature Extraction for Time Series Analysis Using Least-Squares Approximations with Orthogonal Basis Functions

2015 22nd International Symposium on Temporal Representation and Reasoning (TIME), 2016, p.29-37

2016

Volltextzugriff (PDF)

LTL Fragments are Hard for Standard Parameterisations

2015 22nd International Symposium on Temporal Representation and Reasoning (TIME), 2016, p.59-68

2016

Volltextzugriff (PDF)

Semantic Vacuity

2015 22nd International Symposium on Temporal Representation and Reasoning (TIME), 2016, p.111-120

2016

Volltextzugriff (PDF)

Reachability Games on Recursive Hybrid Automata

2015 22nd International Symposium on Temporal Representation and Reasoning (TIME), 2016, p.150-159

2016

Volltextzugriff (PDF)

Undecidability of Chop

2015 22nd International Symposium on Temporal Representation and Reasoning (TIME), 2016, p.79-89

2016

Volltextzugriff (PDF)

1 – 25 von 419

Menü

Weitere Dienste

Einstellungen

Verification of Agent-Based Artifact Systems

Interactions between Knowledge and Time in a First-Order Logic for Multi-Agent Systems: Completeness Results

Quantified epistemic logics for reasoning about knowledge in multi-agent systems

Automated Negotiation: Prospects, Methods and Challenges

Deontic Logic in Computer Science: 7th International Workshop on Deontic Logic in Computer Science, DEON 2004, Madeira, Portugal, May 26-28, 2004. Proceedings

Combining fault injection and model checking to verify fault tolerance, recoverability, and diagnosability in multi-agent systems

4th International Workshop on Strategic Reasoning (SR 2016)

A Sound-and-Complete Propagation-Based Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks

22nd International Symposium on Temporal Representation and Reasoning (TIME 2015)

Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: A Singly-Exponential Time DC-checking

Complexity of ITL Model Checking: Some Well-Behaved Fragments of the Interval Logic HS

Temporal Aspects of Big Data Management: State-of-the-Art Analysis and Future Research Directions

An Executable Semantics of Flexible Plans in Terms of Timed Game Automata

A Team Based Variant of CTL

On the Counting of Strategies

Designing a Deontic Logic of Deadlines

Automated Verification of Quantum Protocols using MCMAS

Global Caching for the Flat Coalgebraic µ-Calculus

Bounded Model Checking for Interpreted Systems: Preliminary Experimental Results

The Price of Evolution in Temporal Databases

Fast Feature Extraction for Time Series Analysis Using Least-Squares Approximations with Orthogonal Basis Functions

LTL Fragments are Hard for Standard Parameterisations

Semantic Vacuity

Reachability Games on Recursive Hybrid Automata

Undecidability of Chop

Suchergebnisse filtern