Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 38 matches
- 1998
- Mirian Halfeld Ferrari Alves, Dominique Laurent, Nicolas Spyratos:
Update Rules in Datalog Programs. J. Log. Comput. 8(6): 745-775 (1998) - Matteo Baldoni, Laura Giordano, Alberto Martelli:
A Modal Extension of Logic Programming: Modularity, Beliefs and Hypothetical Reasoning. J. Log. Comput. 8(5): 597-635 (1998) - Stefano Baratella, Stefano Berardi:
Approximating Classical Theorems. J. Log. Comput. 8(6): 839-854 (1998) - Bernhard Beckert, Reiner Hähnle, Gonzalo Escalada-Imaz:
Simplification of Many-Valued Logic Formulas Using Anti-Links. J. Log. Comput. 8(4): 569-587 (1998) - Massimo Benerecetti, Fausto Giunchiglia, Luciano Serafini:
Model Checking Multiagent Systems. J. Log. Comput. 8(3): 401-423 (1998) - Wilfried Buchholz:
A Note on SLDNF-Resolution. J. Log. Comput. 8(2): 159-167 (1998) - Rachel Cardell-Oliver:
An Equivalence Theorem for the Operational and Temporal Semantics of Real-Time, Concurrent Programs. J. Log. Comput. 8(4): 545-567 (1998) - Maurizio Castellan, Mario Piazza:
Saturated Formulas in Full Linear Logic. J. Log. Comput. 8(5): 665-668 (1998) - Mark d'Inverno, Michael Luck:
Engineering AgentSpeak(L): A Formal Computational Model. J. Log. Comput. 8(3): 233-260 (1998) - Clare Dixon, Michael Fisher, Michael J. Wooldridge:
Resolution for Temporal Logics of Knowledge. J. Log. Comput. 8(3): 345-372 (1998) - Thomas Drakengren, Peter Jonsson:
Reasoning About Set Constraints Applied to Tractable Inference in Intuitionistic Logic. J. Log. Comput. 8(6): 855-875 (1998) - Arnaud Durand, Clemens Lautemann, Thomas Schwentick:
Subclasses of Binary NP. J. Log. Comput. 8(2): 189-207 (1998) - Melvin Fitting:
leanTAP Revisited. J. Log. Comput. 8(1): 33-47 (1998) - Michael Freund:
Preferential Orders and Plausibility Measures. J. Log. Comput. 8(2): 147-158 (1998) - Dov M. Gabbay:
Editorial. J. Log. Comput. 8(1): 3 (1998) - Roberto Giacobazzi:
Abductive Analysis of Modular Logic Programs. J. Log. Comput. 8(4): 457-483 (1998) - Gösta Grahne:
Updates and Counterfactuals. J. Log. Comput. 8(1): 87-117 (1998) - David Gries, Fred B. Schneider:
Adding the Everywhere Operator to Propositional Logic. J. Log. Comput. 8(1): 119-129 (1998) - Robert Harper, Frank Pfenning:
A Module System for a Programming Language Based on the LF Logical Framework. J. Log. Comput. 8(1): 5-31 (1998) - Lauri Hella, Henrik Imhof:
Enhancing Fixed Point Logic with Cardinality Quantifiers. J. Log. Comput. 8(1): 71-86 (1998) - Lex Hendriks:
Intuitionistic Propositional Logic with Only Equivalence Has No Interpolation. J. Log. Comput. 8(4): 589-593 (1998) - Hans Hüttel, Colin Stirling:
Actions Speak Louder Than Words: Proving Bisimilarity for Context-Free Processes. J. Log. Comput. 8(4): 485-509 (1998) - Samin S. Ishtiaq, David J. Pym:
A Relevant Analysis of Natural Deduction. J. Log. Comput. 8(6): 809-838 (1998) - Nicholas R. Jennings, Michael J. Wooldridge, Fausto Giunchiglia:
Editorial. J. Log. Comput. 8(3): 231-232 (1998) - Michael Kaminski, Johann A. Makowsky, Michael L. Tiomkin:
Extensions for Open Default Theories via the Domain Closure Assumption. J. Log. Comput. 8(2): 169-187 (1998) - Kevin Lano:
Logical Specification of Reactive and Real-Time Systems. J. Log. Comput. 8(5): 679-711 (1998) - Fabio Massacci:
Tableau Methods for Formal Verification of Multi-Agent Distributed Systems. J. Log. Comput. 8(3): 373-400 (1998) - Seyed-Hassan Mirian-Hosseinabadi, Raymond Turner:
Constructive Z. J. Log. Comput. 8(1): 49-70 (1998) - Gopalan Nadathur:
Uniform Provability in Classical Logic. J. Log. Comput. 8(2): 209-229 (1998) - Simon Parsons, Carles Sierra, Nicholas R. Jennings:
Agents That Reason and Negotiate by Arguing. J. Log. Comput. 8(3): 261-292 (1998)
skipping 8 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-25 15:02 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint