Остановите войну!
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 29 matches
- 2011
- Marco Alberti, Marco Gavanelli, Evelina Lamma:
The CHR-based Implementation of the SCIFF Abductive System. CILC 2011: 163-177 - Mario Alviano, Wolfgang Faber, Stefan Woltran:
Complexity of Super-Coherence Problems in Answer Set Programming. CILC 2011: 131-145 - Emanuele De Angelis, Alberto Pettorossi, Maurizio Proietti:
Synthesizing Concurrent Programs using Answer Set Programming. CILC 2011: 245-259 - Annamaria Basile, Maria Rosa Felice, Alessandro Provetti:
Formalization and Automated reasoning about a Complex Signalling Network. CILC 2011: 407-414 - Elena Bellodi, Fabrizio Riguzzi:
EM over Binary Decision Diagrams for Probabilistic Logic Programs. CILC 2011: 229-243 - Stefano Bistarelli, Paola Campli, Francesco Santini:
Finding Partitions of Arguments with Dung's Properties via SCSPs. CILC 2011: 199-213 - Dario Campagna, Andrea Formisano:
ProdProc - Product and Production Process Modeling and Configuration. CILC 2011: 261-279 - Domenico Cantone, Marianna Nicolosi Asmundo:
On the satisfiability problem for a 4-level quantified syllogistic and some applications to modal logic. CILC 2011: 73-97 - Claudia Casadio, Mehrnoosh Sadrzadeh:
Cyclic pregroups and natural language: a computational algebraic analysis. CILC 2011: 349-363 - Stefania Costantini, Andrea Formisano:
Nested Weight Constraints in ASP. CILC 2011: 371-383 - Stefania Costantini, Niva Florio, Alessio Paolucci:
A framework for structured knowledge extraction and representation from natural language via deep sentence analysis. CILC 2011: 297-310 - Ilaria De Crescenzo, Salvatore La Torre:
Winning CaRet Games with Modular Strategies. CILC 2011: 327-331 - Giovanna D'Agostino, Giacomo Lenzi:
On modal mu-calculus in S5 and applications. CILC 2011: 9-24 - Davide D'Aprile, Laura Giordano, Valentina Gliozzi, Alberto Martelli, Gian Luca Pozzato, Daniele Theseider Dupré:
Verifying Compliance of Business Processes with Temporal Answer Sets. CILC 2011: 147-161 - Carmine Dodaro, Mario Alviano, Wolfgang Faber, Nicola Leone, Francesco Ricca, Marco Sirianni:
The Birth of a WASP: Preliminary Report on a New ASP Solver. CILC 2011: 99-113 - Onofrio Febbraro, Kristian Reale, Francesco Ricca:
Testing ASP programs in ASPIDE. CILC 2011: 115-129 - Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni:
Controlling Polyvariance for Specialization-based Verification. CILC 2011: 179-197 - Raffaella Gentilini:
A Note on the Approximation of Mean-Payoff Games. CILC 2011: 333-340 - Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato:
Nonmonotonic extensions of low-complexity DLs: complexity results and proof methods. CILC 2011: 41-55 - Francesca A. Lisi, Umberto Straccia:
An Inductive Logic Programming Approach to Learning Inclusion Axioms in Fuzzy Description Logics. CILC 2011: 57-71 - Tania Di Mascio, Rosella Gennari, Pierpaolo Vittorini:
TERENCE: An Adaptive Learning System for Reasoning about Stories with Poor Comprehenders and their Educators. CILC 2011: 365-369 - Francesco Mele, Antonio Sorgente:
The temporal representation and reasoning of complex events. CILC 2011: 385-399 - Dario Della Monica, Margherita Napoli, Mimmo Parente:
Coalitional Games with Priced-Resource Agents. CILC 2011: 341-347 - Massimo Morara, Jacopo Mauro, Maurizio Gabbrielli:
Solving XCSP problems by using Gecode. CILC 2011: 401-405 - Fabrizio Riguzzi:
MCINTYRE: A Monte Carlo Algorithm for Probabilistic Logic Programming. CILC 2011: 25-39 - Dmitry Solomakhin, Enrico Franconi, Alessandro Mosca:
Logic-based reasoning support for SBVR. CILC 2011: 311-325 - Alessio Stalla, Davide Zanucco, Agostino Dovier, Viviana Mascardi:
PrettyCLP: a Light Java Implementation for Teaching CLP. CILC 2011: 281-295 - Neng-Fa Zhou, Agostino Dovier:
A Tabled Prolog Program for Solving Sokoban. CILC 2011: 215-228 - Fabio Fioravanti:
Proceedings of the 26th Italian Conference on Computational Logic, Pescara, Italy, August 31 - September 2, 2011. CEUR Workshop Proceedings 810, CEUR-WS.org 2011 [contents]
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-04-24 20:50 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